c$)$ Use Dijkstra's algorithm to find the length of a shortest path between the vertices $\backslash ($ b $\backslash )$ and $\backslash ($ g $\backslash )$ in the weighted graph below.

d$)$ Use Prim's algorithm to find a minimum$-$cost spanning tree for the weighted graph shown below, starting from vertex $\backslash ($ e $\backslash ).$ Use alphabetical order to break any ties.

Your solution must how the final tree and its cost.