1 The following network shows the lengths, in miles, of roads connecting nine villages.
\includegraphics[max width=\textwidth, alt={}, center]{e47eb41e-0a4b-4865-a8ff-6c9978495ee0-02_856_1251_568_374}
- Use Prim's algorithm, starting from \(A\), to find a minimum spanning tree for the network.
- Find the length of your minimum spanning tree.
- Draw your minimum spanning tree.
- State the number of other spanning trees that are of the same length as your answer in part (a).