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? 1) X={1,2,4} II) X={1,2} 2 4 3 4 1 4 6 5 3