Answer:
Check the explanation
Step-by-step explanation:
1) Algorithm for finding the new optimal flux: 1. Let E' be the edges eh E for which f(e)>O, and let G = (V,E). Find in Gi a path Pi from s to u and a path 
, from v to t.
2) [Special case: If , and 
have some edge e in common, then Piu[(u,v)}uPx has a directed cycle containing (u,v). In this instance, the flow along this cycle can be reduced by a single unit without any need to change the size of the overall flow. Return the resulting flow.]
3) Reduce flow by one unit along 
4) Run Ford-Fulkerson with this sterling flow.
Justification and running time: Say the original flow has see F. Lees ignore the special case (4 After step (3) Of the elgorithuk we have a legal flaw that satisfies the new capacity constraint and has see F-1. Step (4). FOrd-Fueerson, then gives us the optimal flow under the new cePacie co mint. However. we know this flow is at most F, end thus Ford-Fulkerson runs for just one iteration. Since each of the steps is linear, the total running time is linear, that is, O(lVl + lEl).
Problem 1
Plot 3 or 4 of the given points. For example, plot (4,16) and one other point given in the table. Draw a straight line through your points. Look carefully: Where does your line cross the y-axis? If y = 14 (just an example, not the correct value), then the y-intercept is (0,14).
To find the slope of your line, choose any 2 of the given 4 points. Find the slope of the line segment connecting those 2 points. For example:
24 - 16 8
m = ------------- = -------- = 2. The slope of this line is m=2.
8 - 4 4
Now you have both the slope (2) and the y-intercept (b). The equation of this line is thus
y = 2x + b (you found b earlier).
It is 135cm squared please give me brainliest
Step-by-step explanation:
y2-y1/x2-x1
6-(-3)/-5-(-4)
6+3/-5+4
9/-1
