Question It Maximum fiows and minimum cuts. Prove the max-flow nifnecut theoreun atated next: Theorem. If rbere is a maxiution (r,A)-flicw, thest (STEP 1) We consider a fersible (r,s)-fion a and a (r,s)-cot (R) stach that R is defined as follows: (STEP 2) We prove thin u((R))= (b) (2 points) Explain how to combine the steps outlined in part (a) to prove the max-flow rain-cut. theorem. You can state any auxiliary result you might need without proving it. (c) (3 points) Prove in detail STEP 2. You can state any auxiliary result you might need without proving it