The Wirehouse Lumber Company will soon begin logging eight groves of trees in the same general area. Therefore, it must develop a system of dirt roads that makes each grove accessible from every other grove. The distance (in miles) between every pair of groves is as follows: Distance between Pairs of Groves 1 2 3 4 5 6 7 8 1 1.7 2.5 1.3 1.1 2.2 2.4 1.9 2 1.7 1.3 2.2 1.6 3 2.7 1.5 3 2.5 1.3 3 2.1 2.9 2.3 1.4 4 1.3 2.2 3 . 1.1 2 1.9 1.3 5 1.1 Grove 1.6 2.1 11 1.3 1.5 1.2 6 2.2 3 2.9 2 1.3 1 1.4 7 2.4 2.7 2.3 1.9 1.5 1 0.9 8 1.9 1.5 1.4 1.3 1.2 1.4 0.9 Management now wishes to determine between which pairs of groves the roads should be constructed to connect all groves with a minimum total length of road. Use the algorithm as described below Algorithm for the Minimum Spanning Tree Problem: 1. Select any node arbitrarily, and then connect it (i.e., add a link) to the nearest distinct node. 2. Identify the unconnected node that is closest to a connected node, and then connect these two nodes (ie., add a link between them). Repeat this step until all nodes have been connected. 3. 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 52 miles. Moxt