Prove that Prim's algorithm of Exercise 9 yields a minimal spanning tree if the graph is connected. (Hint: Prove by induction that at each step the subgraph created by Prim's algorithm is connected and has no cycles, hence it is a tree, and moreover the Prim tree is contained in some minimal spanning tree.)