Question $14$

Consider the following weighted graph.

Draw the resulting shortest path tree using Prim's Algorithm starting at $A.$

Match the steps in sequence, showing which edges are added to form the minimum spanning tree.

Step $1$

Step $2$