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 $0101020$ Jefferson City Omaha $255030$ Demand $251510$ Total Cost: $$480$ 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 Omaha Total CosteBook Consider the following network representation of a transportation problem: Des Moines $251420$ Jefferson City $16$ Kansas City $151030$ Omaha $5$ SE Louis $10$ Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. The optimal $($cost minimizing Moines Kansas City St$.$Louis Supply