onsider the following network representation of a transportation problem:

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 $0101020$

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 $0.$

Des Moines Kansas City St$.$Louis

Jefferson City

Omaha

Total Cost: $