North 6 South Now formulate this problem as a transportation problem by constructing the appropriate cost and requirements table and determine the optimal solution (15 points 8. Use the augmenting path algorithm to find the flow pattern giving the maximum flow from the supply node to the demand node given that the arc capacity from node i to node is the number nearest node i along the arc between these nodes (10 points) upp Demand4 North 3 6 5 10 South 6 3 4 12 Now formulate this problem as a transportation problem by constructing the appropriate cost and requirements table and determine the optimal solution. (15 points) 8. Use the augmenting path algorithm to find the flow pattern giving the maximum flow from the supply node to the demand node given that the arc capacity from node i to node j is the number nearest node i along the arc between these nodes. (10 points) 4 4 1 1 3 3 4 9 4 6 1 2 3 4 5 6 7 Supply Demand