2) Use Prim's Algorithm (implemented manually, not as a program) to determine a minimal spanning tree for the graph shown to the right, where each edge is labeled with its weight. 18 5 25 (a) Initially, add node A and calculate values for the 16 13 MIN WEIGHT array. Then, for each iteration of the algorithm, list the node and edge added and calculate updated MIN WEIGHT values. 20 24 (b) Repeat step (a), starting with node F. (c) Draw the final minimal spanning tree(s) and calculate the total weight of each tree