4. Max Flow Min Cut: a) Below we have an instance of a flow network with the source s and terminal t and edge capacities shown. Show the max flow and the min cut on the same figure. Also write down the value of that flow and the capacity of that st-cut below the figure as indicated. [Recommendation: do the scratch work on back-side of a page first.] 9 yo Max flow value = Min st-cut capacity = Now answer the following parts (b)-(d) for a general Flow Network N= (V, E, C, s, t): b) Given a flow f for a flow network N, how would you algorithmically determine whether fis a feasible flow for N in O(VI+ El) time? 4. Continued: c) Given a feasible flow f for a flow network N, how would you algorithmically determine whether f is a max flow for N in O(VI+ E time? d) Given a max flow f for a flow network N, how would you algorithmically determine a min capacity st-cut for N in O( |VI + |El) time