Consider the minimum cost network flow problem given in attachment below, which provides the cost Cij of sending each unit of flow on arc (i,j); there is no upper bound on the amount of flow that can be sent on each arc, and the dashed boxes near a node indicate its supply or demand. Use the network simplex algorithm to solve this problem.

K OPTIMIZATION ALGORITHMS 20 15 q 25 15 4 10 15 15 30 10 20 ?151 (2 20 40 5 40 15 208 25 2 15/140?15 30 30 25 25 20 E 12.33 Minimum cost flow problem for Exercises 2.12, we introduced the minimum cosn t K OPTIMIZATION ALGORITHMS 20 15 q 25 15 4 10 15 15 30 10 20 ?151 (2 20 40 5 40 15 208 25 2 15/140?15 30 30 25 25 20 E 12.33 Minimum cost flow problem for Exercises 2.12, we introduced the minimum cosn t