2 4 14 6 10 2 Figure 1: Undirected graph for computing MSTs. 1. Prim's algorithm for a computing Minimum Spanning Tree (MST) starts with a given vertex and selects nearest neighbor of the vertex. The tree is grown by adding a vertex nearest to current subtree, until all the vertices reachable from the starting node have been included in the tree. Show the action of Prim's MST algorithm on the graph in Figure 1 with starting node d. Use illustrations similar to the book