Suppose that you are given a flow network g, and g has edges entering the source s. let f be a flow in g in which one of the edges .; s/ entering the source has f .; s/ d 1. prove that there must exist another flow f 0 with f 0 .; s/ d 0 such that jf j d jf 0 j. give an o. e/-time algorithm to compute f 0 , given f , and assuming that all edge capacities are integers