3 The network shows 10 towns. The times, in minutes, to travel between pairs of towns are indicated on the edges.
\includegraphics[max width=\textwidth, alt={}, center]{fe9c0da0-40e3-4a87-ae9a-13ec0740ffff-06_1299_1308_406_367}

1. Use Kruskal's algorithm, showing the order in which you select the edges, to find a minimum spanning tree for the 10 towns.
2. State the length of your minimum spanning tree.
3. Draw your minimum spanning tree.
4. If Prim's algorithm, starting at \(B\), had been used to find the minimum spanning tree, state which edge would have been the final edge to complete the minimum spanning tree.
   (1 mark) \includegraphics[max width=\textwidth, alt={}, center]{fe9c0da0-40e3-4a87-ae9a-13ec0740ffff-07_2484_1709_223_153}
   \includegraphics[max width=\textwidth, alt={}, center]{fe9c0da0-40e3-4a87-ae9a-13ec0740ffff-08_2486_1724_221_143}
   \includegraphics[max width=\textwidth, alt={}]{fe9c0da0-40e3-4a87-ae9a-13ec0740ffff-09_2484_1709_223_153}