We know that the value of the maximum flow is unique in flow networks. However, there can be more than one max-flow function achieving this maximum value. Now, consider a flow network G = (V, E, s, t, c) where we have the following property: 1, 2, V1, V V: [c(u, ) 0 c(v, v) 0 ^ (U, U) (V, V) ] [c(u, U) # C(V, V) ] ^ Claim A: For such flow networks, there is exactly one max-flow function. Is Claim A true or false? If true, prove it (no partial points if no proof is given). If false, give a counter example by using a flow network of at most 4 nodes on which you need to provide two different max-flow functions (no partial points if no counter example is given or if the counter example uses 5 or more nodes).