Arcs and arc capacities of a network are given in the below table. a. Find the maximum flow from the source to the sink using FordFulkerson algorithm. b. Find all cuts on this network. Compute capacities of all cuts, and observe that each cut capacity provides an upper bound for the maximum flow value. (Recall that this is true by weak duality because each cut is a dual feasible solution). Observe that there is a cut whose capacity equals to the maximum flow in the network