Consider 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 $2001030$

Omaha $515020$

Demand $251510$

Total Cost: $$540.$

Find an alternative optimal solution for the above problem. If your answer is zero, enter $0.$

Des Moines Kansas City St$.$Louis

Jefferson City

$5$

$15$

Omaha

Total Cost: $

$.$