Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines 125 70 150 Jefferson City 45 35 40 Kansas City 75 30 100 Omaha 23 St. Louis 50 Supplies Demands The supplies demands and transportation costs per unit are shown on the network The supplies, demands, and transportation costs per unit are shown on the network. a. Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the box. Let Xy - amount shipped from supply node i to demand nodej. Min X11+ X121+ X131+ X221+ X23 s.t. X11+ X12 X13 211 X221 X2315 X21 X13 X11 X12, X13X21, X32, 23 20 b. Solve the linear program to determine the optimal solution. Enter "o" if your answer is zero. Quantity Cost Jefferson City - Des Moines Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City Omaha - St. Louis $ Total Cost