\documentclass{article}
\begin{document}


\begin{center}
{\LARGE CS140: Algorithms }\\
\vspace{.1 in}
{\Large Fall 2001}\\
\vspace{.3 in}
{\large Worksheet - Lecture 3}
\end{center}

\vspace{1 in}

\vspace {2 in}

Answer the following questions about the work tree for ${\cal A}$
on input size $n$.
\begin{enumerate}
\item
What is the input size to a node at level $i$, where the root is at level $0$?
\item
How much work is done at a node at level $i$?
\item
How many nodes are at level $i$?
\item
What is the total amount of work done by the nodes at level $i$?
\item
The root is at level $0$.  What level are the leaves at?
\item
Write a series that represents the running time of the algorithm for inputs of size
$n=3^m$.
\end{enumerate}


\end{document}
