1 The following network shows the lengths, in miles, of roads connecting 11 villages, \(A , B , \ldots , K\).
\includegraphics[max width=\textwidth, alt={}, center]{6360ed01-76da-4265-8bc8-53ffe391704e-2_915_1303_591_365}
- Starting from \(G\) and showing your working at each stage, use Prim's algorithm to find a minimum spanning tree for the network.
- State the length of your minimum spanning tree.
- Draw your minimum spanning tree.