1. Prove, disprove (give a counterexample, highlight the incorrectness or give the correct answer) or complete a proof. (p) Let f be any flow in an S-t network N, and let (Vs, V:) be any s-t cut. Then val (7) can be larger than cap (V, V:). Corollary. Let be a flow in an s-t network N and K an s-t cut, and suppose that val() = cap(K). Then flow is a maximum flow in network N, and cut K is a minimum cut