Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines 475 266 171 5701 Jefferson City 133 Kansas ) 285 152 190 City 380 Omaha 95 St. Louis Supplies Demands 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. Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: 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 xij = amount shipped from supply node i to demand node). Min X13 + x21 + + X22 + X21 + x2 + x23 X11, X12, X13. X21, X22 X232 0 b. Solve the linear program to determine the optimal solution. Enter "0" 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