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. Initially, add node D and calculate values for the Min_Weight array. Then, for each iteration of the algorithm, list the node and edge added and calculate updated Min_Weight values. Draw the final minimal spanning tree. What is the total weight of the minimal spanning tree