Consider the minimum cost flow problem shown below, where the bi values are given by the nodes, the cij values are given by the arcs, and the finite uij values are given in parentheses by the arcs. Obtain an initial BF solution by solving the feasible spanning tree with basic arcs A $->$ C$,$ B $->$ A$,$ C $->$ D$,$ and C $->$ E$,$ where one of the non$-$basic arcs $($D $->$ A$)$ is a reverse arc. C is a transhipment node. Solve using network simplex algorithm. A D C B E