$[$Total $=10pts][$MAX CUT $-$ MIN FLOW$]$

Determine the maximum flow from source node $S$ to sink node $T$ in the following

flow network and identify a minimum cut. $($The label on an edge indicates edge

capacity.$)$ Is the number of minimum cut$($s$)$ greater than $1?$ Show the flow

through each edge that realizes the maximum flow on the next page.

MAXIMUM FLOW $=$

A MINIMUM CUT $($partition of nodes obtained from a cutset$)=$

Is the number of distina MAXIMUM FLOW REALIZATIONS $>1?$

Circle$/$Boldface$/$Highlight ONE OF: YES $/$ NO

Complete the following table to display athe maxflow configura

table encodes the directed graph with last column showing

bhelled with is flow:$)$