$($a$).$ In what order were the edges insterted into the Minimum Spanning Tree $($MST$)$ using Prim$$s algorithm starting at node C$?($b$).$ In what order were the edges insterted into the Minimum Spanning Tree $($MST$)$ using Kruskal$$s algorithm? Now, start at node F: Applying Dijkstra$$s algorithm to find the shortest path tree from node F$.($c$).$ In what order do the nodes become permanent? $($d$).$ What are the edges in the Shortest Path Tree $($SPT$)?$