Hey guys, I am struggling with this problem. I dont know where to begin with. I have to make a model in excel for this problem and solve from A to D. Can someone help me solving this problem by showing each step please ? I would really apprecite it. PS: please make to put a clear picture and a good explanation about the answer you come up with.

Problem 4 (6 points Baseball umpiring crews are currently in four cities where three-game series are beginning. When these are finished, 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: Chicago Detroit Toronto From. To Kansas City Seattle 1500 1730 1940 2070 Arlington 460 1020 810 1270 X Oakland 1500 1850 2080 Baltimore 960 610 400 330 The X indicates that the crew in Oakland cannot be sent to Toronto. Determine which crew should be sent to each city to minimize the total distance traveled. How many miles will be 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. A) Identify the type of network problem (0.6 pt) B) Draw the network diagram including all the nodes and all the possible connections. Also include all supply and demand quantities and the costs on the diagram. (1.4 pts) C) Formulate this problem into a linear programming model (including decision variables, objective function, and constraints. Don't forget to label the constraints (2 pts) D) Solve this problem using Excel Solver and interpret the solution. (2 pts)