5 The network shows the lengths, in miles, of roads connecting eleven villages.
\includegraphics[max width=\textwidth, alt={}, center]{76bccb26-f2ec-4798-bb6b-89c922f9651a-04_1100_1575_406_251}
- Use Prim's algorithm, starting from \(A\), to find the minimum spanning tree for the network.
- State the length of your minimum spanning tree.
- Draw your minimum spanning tree.
- A student used Kruskal's algorithm to find the same minimum spanning tree. Find the seventh and eighth edges that the student added to his spanning tree.