Consider the minimum cost flow problem shown above, where the bi values (net flows generated) are given by the nodes, the cij values (costs per unit flow) are given by the arcs, and the uij values (arc capacities) are given to the right of the network. Do the following work manually

(a) Obtain an initial BF solution by solving the feasible spanning tree with basic arcs A B, C E, D E, and C A (a reverse arc), where one of the nonbasic arcs (C B) also is a reverse arc. Show the resulting network (including bi, cij, and uij) in the same format as the above one (except use dashed lines to draw the nonbasic arcs), and add the flows in parentheses next to the basic arcs.

(b) Use the optimality test to verify that this initial BF solution is optimal and that there are multiple optimal solutions. Apply one iteration of the network simplex method to find the other optimal BF solution, and then use these results to identify the other optimal solutions that are not BF solutions.

(c) Now consider the following BF solution.
Starting from this BF solution, apply one iteration of the network simplex method. Identify the entering basic arc, the leaving basic arc, and the next BF solution, but do not proceed further.