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:

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.
(a) Describe how this problem fits the network description of the minimum spanning tree problem.
(b) Use the algorithm described in Sec. 10.4 to solve the problem.

Distance between Pairs of Groves 2 4 5 8 1.3 2.1 0.9 0.7 1.8 2.0 1.5 2 1.30.9 18 .2 2.6 2.3 1.1 3 2. 0.92.6 .7 2.5 1.9 1.0 Grove 4 0.9 18 2.6 _ 0.7 6 1.5 0.9 5 0.71.2 1.7 0.70.9 1 0.8 6 1.8 2.6 2.5 1.6 0.9 0.6 1.0 7 2.0 2.3 9 1.5 1 0.60.5 8 15 .0 0.9 0.8 1.0 0.5