Use the algorithm as described below

Algorithm for the Minimum Spanning Tree Problem:

Select any node arbitrarily, and then connect it $($i$.$e$.,$ add a link$)$ to the nearest distinct node.

Identify the unconnected node that is closest to a connected node, and then connect these two nodes $($i$.$e$.,$ add a link between

them$).$ Repeat this step until all nodes have been connected.

Tie breaking: Ties for the nearest distinct node $($step $1)$ or the closest unconnected node $($step $2)$ may be broken arbitrarily, and the

algorithm must still yield an optimal solution. However, such ties are a signal that there may be $($but need not be$)$ multiple optimal

solutions. All such optimal solutions can be identified by pursuing all ways of breaking ties to their conclusion.

Use this to solve the problem and determine the minimum total length of road.

The minimum total length of road is

miles.