the Abujoudeh ranch (A), the Bernard ranch (B), the Cheng ranch (C), the Egwu ranch (E), and the Fernandez ranch (F). She plans to leave her office at the Davis ranch and then visit each of the other ranches before returning to the Davis ranch. Her problem is to find the route with the shortest possible distance. (a) The weighted graph below shows the distance (in miles) between each pair of locations, including the Davis ranch (D). On the graph, use the Cheapest Link Method to indicate a Hamilton circuit that gives an approximate solution to Laura's problem. (You can highlight on the graph, but the highlighting will not be graded.) Since Laura is starting from the Davis ranch, the Hamilton circuit must start and end at the Davis ranch (D). The tahle helnw licte the woinhte of the ednec in order from cmallect to larnect Method, what will be the total distance she will drive