A final handout to prove optimality of our greedy algorithm.

NOTE: Problem 2 should ask about a bound on a solution produced by the greedy algorithm in terms of the last intra-category edge across which it merged. (You can answer the question as it stands, and it remains an interesting question.. just not useful for the rest of the worksheet!)