State the Max-Flow Min-Cut Theorem. [2 marks](b) For an arbitrary integer k 1, give an example of a flow network with at mostfive vertices on which the basic Ford-Fulkerson method takes at least k steps toterminate. [4 marks](c) Consider the following flow network G:Given an initial flow f with f(s, u) = f(u, w) = f(w, t) = 2, perform oneiteration of Ford-Fulkerson; that is, draw the residual graph Gf , specify anaugmenting path in Gf , and update the flow f. Is this new flow a maximumflow? Justify your answer. [5 marks]