Given a graph G = (V,E), the source-sink pair (s,t) and capacityof edges {C_e ≥ 0 | e ∈ E}, design a polynomial-time algorithm tofind a set of edges S, such that for every edge e ∈ S, increasingC_e will lead to an increase of max-flow value between s and t.Show the correctness of your algorithm.
