Consider the following maximum flow problem a) Formulate the problem to send maximum flow from node 1 to 6. b) Find the cut set for each of the following cases. Which one can be the optimal solution? 13.5 II) X={1,2,4} 7 1 2 1 6 5 5 3 4