Please solve the complete exercise from the picture.

D$,$I $10\mathrm{.}7-7.$ Consider the minimum cost flow problem shown below, where the $\backslash ($ b$\_\{$i$\}\backslash )$ values are given by the nodes, the $\backslash ($ c$\_\{$i j$\}\backslash )$ values are

given by the arcs, and the finite $\backslash ($ u$\_\{$i j$\}\backslash )$ values are given in parentheses by the arcs. Obtain an initial BF solution by solving the feasible spanning tree with basic arcs $\backslash ($ A $\backslash$rightarrow C$,$ B $\backslash$rightarrow A$,$ C $\backslash$rightarrow D $\backslash ),$ and $\backslash ($ C $\backslash$rightarrow E $\backslash ),$ where one of the nonbasic arcs $\backslash (($D $\backslash$rightarrow A$)\backslash )$ is a reverse arc. Then use the network simplex method yourself $($you may use the interactive procedure in your IOR Tutorial$)$ to solve this problem.

$10\mathrm{.}8-1.$ The Tinker Construction Company is ready to begin a project that must be completed in $12$ months. This project has four activities $(\backslash ($ A$,$ B$,$ C$,$ D$)\backslash )$ with the project network shown next.

The project manager, Sean Murphy, has concluded that he cannot meet the deadline by performing all these activities in the normal way. Therefore, Sean has decided to use the CPM method of time$-$cost trade$-$offs to determine the most economical way of crashing the project to meet the deadline. He has gathered the following data for the four activities.

Use marginal cost analysis to solve the problem.