Problem 5. We make a digraph from G and define capacities on its edges. Orient the edges between (i, j) and (i, j +1) as (i, j) + (i, j +1) and put capacity 2 on them. Orient the edges between (i, j) and (i +1,j) as (i, j) (i+1,j) and put capacity 1000 on them. What is the maximum flow value from s to t? If you state a value, justify with a flow as clearly described as possible, and argue with a cut that bigger flow value is not possible. Problem 5. We make a digraph from G and define capacities on its edges. Orient the edges between (i, j) and (i, j +1) as (i, j) + (i, j +1) and put capacity 2 on them. Orient the edges between (i, j) and (i +1,j) as (i, j) (i+1,j) and put capacity 1000 on them. What is the maximum flow value from s to t? If you state a value, justify with a flow as clearly described as possible, and argue with a cut that bigger flow value is not possible