THIS QUESTION IS AN ALGORITHM ( MAX FLOW) PROBLEM, PLEASE USE CLEAR ENGLISH PSEUDOCODE.

Assume that you are given a network flow graph G with a source s, a sink t and two other distinct vertices u and v. Design an algorithm which returns a smallest capacity cut among all cuts for which the vertex u is in the same side of the cut as the source s and vertex v is in the same side as the sink t and which runs in polynomial time