2. Write a program that employs the greedy algorithm to find the minimum spanning tree for a graph. A spanning tree T for a graph G is a tree whose vertex set is the same as the vertex set for the graph. Consider the graph in 2.38(a). A spanning tree is provided in Figure 2.38(b).

Observe that the Spanning tree in Figure 2.38

(c) has minimal cost. The latter tree is referred to as a minimum spanning tree. Your program should find a minimum spanning tree for the graph in 2.38(d).