(a) Demonstrate Prim’s algorithm starting from vertex A. Writethe edges in the order they were added to the minimum spanningtree.

(b) If each edge weight is increased by 1 will this change theminimum spanning tree? Explain.

7 15 10 12 (a) Demonstrate Prims algorithm starting from vertex A. Write the edges in the order they were added to the minim

7 15 10 12 (a) Demonstrate Prim’s algorithm starting from vertex A. Write the edges in the order they were added to the minimum spanning tree. (b) If each edge weight is increased by 1 will this change the minimum spanning tree? Explain. Show transcribed image text