Question: 1. Compute the total weight of each of the spanning trees shown in Figure. Which has the smallest weight? Is that the minimum possible weight? If not, construct a minimum-weight spanning tree.
2. Develop an algorithm for finding a minimum-weight spanning tree in a connected graph.
3. Did your algorithm begin with just the vertices, or did it begin with the whole graph? Find a second algorithm that begins differently than your first.