An East Coast airline company wants to expand service to the Midwest and has received permission from the Federal Aviation Authority to fly any of the routes with distances in miles shown in the following figure: Minneapolis 355 Milwaukee 74 695 Chicago 348 262/ Detroit 230 306 269 Cincinnati 83 Louisville St. Louis 242 151 Nashville The airline company wants to serve all the cities shown, but with a route system that minimizes the total mileage. Use Kruskal's algorithm to solve this problem for the airline.