Problem
1. Give another minimum spanning tree for the example graph at the beginning of the chapter.
2. Give an algorithm to find the minimum spanning forest of a connected graph (each vertex must be touched by some edge, but the resulting graph need not be connected).
3. Is there a graph with V vertices and E edges for which the priority-first solution to the minimum-spanning-tree problem could require time proportional to (E + V) log V? Give an example or explain your answer.