Consider the following graph:

Apply Prim's algorithm to calculate a Minimum Spanning Tree starting from vertex A$.$ Show each steps of your calculation. If during your algorithm two unvisited vertices have the same distance, use alphabetical order to determine which one is selected first. Also, list the vertices in the order in which Prims algorithm marks them known.

Draw the constructed MST$.$