1. How can one use Prim's algorithm to find a spanning tree of a connected graph with no weights on its edges? Is it a good algorithm for this problem?
2. Prove that any weighted connected graph with distinct weights has exactly one minimum spanning tree.
3. Outline an efficient algorithm for changing an element's value in a min-heap. What is the time efficiency of your algorithm?