Network Flow Cut Explanation - Copy this React, Tailwind Component to your project

State true or false with justification: Let G be an arbitrary flow network, with a source s, a sink t, and a positive integer capacity c(e) on every edge e; and let (A, B) be a minimum s t cut with respect to these capacities {c(e) : e e E}. Now suppose we add 1 to every capacity; then (A, B) is still a minimum s t cut with respect to these new capacities {1+ c(e) : e e E}.