1. Prove, disprove (give a counterexample, highlight the incorrectness or give the correct answer) or complete a proof. (9) Let (Vs, V.) be an s-t cut in a network N, and suppose that fis a flow such that s(e) = { { caple) ife E (V,V:) . Then f is a maximum flow in N, and (Vs, V) is a 0 ife (V., V.) minimum cut