$($Max$-$flow Min$-$cut$).$ Obtain a maximum flow and minimum cut in the network shown below. In the figure, the arc label is denoted by $(f,c),$ where $f$ is the flow along the arc and $c$ is the capacity of the arc.