During the course, we worked with Prim's Algorithm and identified it as a "greedy" algorithm used to find the Minimum Spanning Tree $($MST$)$ of a connected, undirected, weighted graph.

Starting at vertex $A,$ consider the weighted graph $G$ with vertices $V(G)=\{A,B,C,D,E,F,G\}$ and select the option. that correctly describes the steps of edge selection using Prim's algorithm and the final total weight of the. Minimum Spanning Tree $($MST$).$P