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

Which of the following would be a correct step in proving that triangle abc is congruent to triangle cda? a. use a protractor to measure the angles and show that all the corresponding angles are equal in measure. this will allow you to prove congruence by aaa. b. show that segment ab is parallel to segment cd and segment ad is parallel to segment cb. this will allow you to prove congruency by asa. c. show that is segment ab is perpendicular to segment ad. this will allow you to prove congruence by sas. d. none of the above.