\documentclass[12pt]{article}
\usepackage{fullpage}
\usepackage{epsfig}
\usepackage{latexsym}
\begin{document}
\begin{center}
\bf
Algorithms\\
Computer Science 140 \& Mathematics 168\\
Instructor: B. Thom\\
Spring 2004\\
\rm
Homework 8a\\
Due on 3/11/04 (beginning of class)\\
\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---you should apply the Big MST
Theorem here---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. Also, if it doesn't work, explain what it is that
keeps the General Theory from being applicable here.



\end{enumerate}
\end{document}
