Run Prim's algorithm with the root vertex a for finding the minimum spanning tree on the

following graph; whenever there a choice of nodes, always use alphabetic ordering. Mark on

the graph showing the intermediate values, and list the final minimum spanning tree.