\documentclass[12pt]{article}
\usepackage{fullpage}
\usepackage{latexsym}
\begin{document}
\begin{center}
\bf
Algorithms\\
Computer Science 140 \& Mathematics 168\\
Instructor: B. Thom\\
Fall 2003\\
\rm
Homework 10a\\
Due on 11/7/2003 (Friday at 2pm)\\
\end{center}
\begin{enumerate}
\item {\bf [10 points] Greed is G-r-e-a-t!}
CLRS, Exercise 23.2-8 (page 574). If the algorithm works, use the General Theory of
Minimum Spanning Trees (which relies on the Big MST Theorem) to prove it. If it doesn't work, give a counter example by
showing the tree constructed by the algorithm and contrasting it with some better tree.
If it doesn't work, also explain why the General Theory of Minimum Spanning Trees
is not applicable in this algorithm.



\end{enumerate}
\end{document}
