Consider an s-t flow network G = (V;E). Assume that every edge e has an integer capacity c(e) > 0. There may be several s-t minimum (capacity) cuts in G. Let us say that an s-t minimum (capacity) cut (S; T) is thin if the number of edges that (S; T) cuts is less than or equal to the number of edges that every other minimum cut (S0; T0) cuts. Design an algorithm that nds a thin minimum cut (S; T). Prove its correctness. Answer. Given source node s and sink node t, we can compute maximum flow and capacity of minimum cut in network G = (V;E) using Ford-Fulkerson Algorithm.