Consider the following network representation of a transportation problem. Des Moines) 65 14 90 Jefferson City 16 7 Kansas City 55 8 10 80 Omaha St. Louis 50 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. (Assume x11 = amount shipped from Jefferson City to Des Moines, X12 = amount shipped from Jefferson City to Kansas City, x3 = amount shipped from Jefferson City to St. Louis, X21 amount shipped from Omaha to Des Moines, X22 amount shipped from Omaha to Kansas City, and X23 amount shipped from Omaha to St. Louis.) = Des Moines Kansas City St. Louis Supply Jefferson City 40 0 50 90 Omaha Demand 25 55 0 80 65 55 50 Use the procedure described in Section 12.7 to try to find an alternative optimal solution. (Round your answers to the nearest integer.) (x11' 12' x 13' 21' x 22'x23)=1