Consider the following network representation of a transportation problem: Des Moines 30 14 30 Jefferson City 16 Kansas City 10 10 20 Omaha s St. Louis 10 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. Des Moines Kansas City St.Louis Supply Jefferson City 20 0 10 30 Omaha 10 10 0 20 Demand 30 10 10 Total Cost: $530. Find an alternative optimal solution for the above problem. If required, round your answer to nearest whole number and if your answer is zero enter "O". Des Moines Kansas City St.Louis Jefferson City BE Omaha Total Cost: $