Consider the minimum flow problem shown below, where the source is node A, the sink is node F, and the arc capacities are the numbers shown next to these directed arcs. Use the Augmenting Path Algorithm (Ford-Fulkerson Method) for the Minimum Flow Problem to find the flow pattern giving the minimum flow from the source to the sink. Formulate this problem as a minimum cost flow problem by showing the appropriate network representation, including adding the arcAF. Use F=16. List the augmenting path and c for each iteration in the above table. Show your final result by either listing the optimal flow assignment paths or clearly labeling the flow on the network