1. Compute the total weight of each of the spanning trees shown in Figure 10.2. Which has the smallest weight? Is that the minimum possible weight? If not, construct a minimum-weight spanning tree.
![557_08bd18e5-c741-4686-8d82-9a36287d6351.png](https://secure.tutorsglobe.com/CMSImages/557_08bd18e5-c741-4686-8d82-9a36287d6351.png)
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.