$($b$)$ Use Prim's algorithm to compute a minimum spanning tree for the following weighted graph. Since every vertex is on every spanning tree, one can start the process from any vertex of the graph. Start from the vertex labeled with the first letter in your last name. Circle the starting vertex and label the edges of the spanning tree you found according to the order you added to the spanning tree.

The first letter in your last name is: