1. Execute Prims minimum spanning tree algorithm by hand on the graph below showing how the data structures evolve specifically indicating when the distance from a fringe vertex to the tree is updated. Clearly indicate which edges become part of the minimum spanning tree and in which order. Start at vertex A.

2 A B 3 6 G 4 3 F I H 5 4 2 2 8 6 2 E D