Recall that a flow network is a directed graph = ( , ) G=(V,E) with a source s, a sink t, and a capacity function : 0 + c:VVR 0 + that is positive on E and 0 0 outside E. We only consider finite graphs here. Also, note that every flow network has a maximum flow. This sounds obvious but requires a proof (and we did not prove it in the video lecture). Which of the following statements are true for all flow networks ( , , , ) (G,s,t,c)? 1 point If = ( , ) G=(V,E) has as cycle then it has at least two different maximum flows. (Recall: two flows , f,f are different if they are different as functions VVR. That is, if ( , ) ( , ) f(u,v) =f (u,v) for some , u,vV. The number of maximum flows is at most the number of minimum cuts. The number of maximum flows is at least the number of minimum cuts. If the value of f is 0 0 then ( , ) = 0 f(u,v)=0 for all , u,v. The number of maximum flows is 1 or infinity. The number of minimum cuts is finite.