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

depends on how many days you are talking about

step-by-step explanation:

step-by-step explanation:

i think something is missing in your question because y-1=(x-12) would not pass through the point (-4,-3). because if you replace x by -4 your are supposed to find y=-3 which is not the case her. if you replace x by -4 you find =-15.

i assume the right equation is y-1=1/4*(x-12) because this one is passing through both your points (if you are interested to know how i found that out i can tell you).

in this equation if i replace x by -4 i find y=-3 and if i replace x by 12, i find y=1 so the line representing this equation is passing through those 2 points.

then the standard form of the equation is finding an expression of y in function of x

y-1=1/4*(x-12)

y=x/4-3+1

y=x/4-2

hope that .

do you confirm there was a mistake in the question?

it is contrapositive

i could not see the question too well so check yourself again too . this is because i want you to get it correct.

answerim :

n

step-by-step explanation:

im not sure but my dad knows