As discussed in the class, the single-link k clustering problem can be solved based on minimum spanning tree (MST) algorithms. There are two natural algorithms:

(a) Apply Kruskals algorithm and stop when there are k components, and

(b) Apply Prims algorithm to obtain a MST and then delete k 1 longest edges.

Are the above two algorithms equally good, or one is better than the other? Please justify your answer.