Baseball umpiring crews are currently in four cities where three-game series are beginning. When these are nished, the crews are needed to work games in four different cities. The distances (miles) from each of the cities where the crews are currently working to the cities where the new games will begin are shown in the following table: 1500 1730 20m 1020 12m 1500 1850 2080 m The X indicates that the crew in Oakland cannot be sent to Toronto. Determine which crew should he sent to each city to minimize the total distance traveled. How many miles will he traveled if these assignments rare made? In Problem 4 the minimum travel distance was found. To see how much better this solution is than the assignments that might have been made, find the assignments that would give the maximum distance traveled. Compare this total distance with the distance found before