6. (5 points) Find the minimum spanning tree (MST) to the following graph using the Prim's algorithm as you learned in the class. For the problem, you have to start the algorithm from the vertex I. Then, present the sequence of vertices/edges to be added, indicate the weights for the edges, and draw the result MST clearly. Page 2 of 5 - 1- 15 16 / 1 13 179 - 3 11