(Solved): Below is a weighted graph. Apply Prim's algorithm to find the minimum spanning tree. The root vert ...

Below is a weighted graph. Apply Prim's algorithm to find the minimum spanning tree. The root vertex is \( \mathrm{s} \). a. Show the intermediate steps during execution. b. Show the key values and parent-child relationship. c. Draw the minimum spanning tree.