Hi, I'm not sure how to do this, any help is appreciated thanks!

The Minimum Flow Problem. Assume that each arc (i,j) E A has a lower bound lij > 0 and well as an upper bound wij on the amount of flow that must be routed along it. In the minimum flow problem we wish to send a flow f of minimum value from the source to the sink such that f satisfies the lower and upper bounds on every arc. Prove the following minflow-maxcut theorem: let the floor of an s - t cut S+(S) be l(S) = {(1,j]8+(5) bij - Elisjes-(s) Wij. Show that the minimum value of all feasible s-t flows equals the maximum floor of all s-t cuts. The Minimum Flow Problem. Assume that each arc (i,j) E A has a lower bound lij > 0 and well as an upper bound wij on the amount of flow that must be routed along it. In the minimum flow problem we wish to send a flow f of minimum value from the source to the sink such that f satisfies the lower and upper bounds on every arc. Prove the following minflow-maxcut theorem: let the floor of an s - t cut S+(S) be l(S) = {(1,j]8+(5) bij - Elisjes-(s) Wij. Show that the minimum value of all feasible s-t flows equals the maximum floor of all s-t cuts