Consider the following network representation of a transportation problem. Des Moines DE 15 50 Jefferson City Kansas 20 City 10 25 Omaha 24 St. Louis 25 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. (2) Develop a linear programming model for this problem; be sure to define the variables in your model. Let - amount shipped from Jefferson City to Des Moines *ja - amount shipped from Jefferson City to Kansas City *ya - amount shipped from Jefferson City to St. Louis * - amount shipped from Omaha to Des Moines * = amount shipped from Omaha to Kansas City * - amount shipped from Omaha to St. Louis Mn S.t. X *11 (b) Solve the linear program to determine the optimal solution. Amount Cost Jefferson City-Des Moines Jefferson City-Kansas City Jefferson City-St. Louis Omaha-Des Moines Omaha-Kansas City Omaha-St. Louis Total