I. Given the following graph G1 in Figure 1, find the minimum spanning tree using the Prim's algorithm, and starting at node G. Show only the resulting minimum spanning tree and its total cost. At any point during the algorithm, if you have to choose between multiple nodes to add to the minimum spanning tree, choose the one with the smallest lexicographic (Alphabetical) order. D 1 3 A E 1 1 1 B 3 F 5 G 3 H 1 I J Figure 1. Graph G1 Total Cost:?? 4.