Let G be an input graph to the max flow problem. Let (A, B) be a minimum capacity s - t cut in the graph. Suppose we add 1 to the capacity of every edge in the graph. Is it necessarily true that A is still a minimum cut? If so, prove it, if not give a counterexample. Let G be an input graph to the max flow problem. Let (A, B) be a minimum capacity s - t cut in the graph. Suppose we add 1 to the capacity of every edge in the graph. Is it necessarily true that A is still a minimum cut? If so, prove it, if not give a counterexample