With explaination and graph please.

Thank you

5. Decide whether you think the following statement is true or false. If it is truc, give a short explanation. If is false, give a counterexample. . Let G be an arbitrary flow network, with source a source s, a sink t, and a positive integer capacity c on every edge e. If f is a maximum s- flow in G, then & saturates.exery edge out of s with flow (ie for all edges"utors, we have f(e) = ce). Let G be an arbitrary flow network, with a source s, a sink t, and a positive integer capacity ce on every edge e; and let (A, B) be a mimimum s-t cut with respect to these capacities. Now suppose we add 1 to every capacity; then (A, B) is still a minimums-t cut with respect to these new capacities