PROBLEM 5 Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex A. Explain and justify each step as you add an edge to the tree. 2 . r l :f A '; 71 : a" r | l 5 7.5.?\" 5 4 l> Figure 10: A weighted graph shows 5 perttees, represented by circles, and 6 ea'ges, represented by line segments. Vertices A, B, C, anar D are placed at the corners of a rectangle, whereas vertezt E is at the center of the rectangle. The edges, A B, B D, A C, C D, A E, and E C, have the weights, 7, 3, 2, 4, 5, and 6, respectively