Consider the following network representation of a transportation problem: 20 20 Des 30 Moines 14 Jefferson City 16. Kansas City 10 10 30 Omaha 3 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 0 10 10 20 Omaha 30 0 0 30 Demand 30 10 10 Total Cost: $470. 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 "0" Des Moines Kansas City St.Louis Jefferson City 10 10 0 Omaha 20 10 Total Cost: $ 510