QUESTION $2$

Apply Edmonds$-$Karp algorithm to the graph above. Consider that the adjacency lists are in alphabetical order. The first augmenting path is $(s$

$,t)$ with residual capacity

The final flow is

$($s$,$u$).$f:

$(u,t).f=$

$($u$,$v$).$f$=$

$,($v$,$t$).$f$=$

$|.$ The value of the flow is

The

number of iterations was

$(s,v)f=$

$($u$,$v$)f=$

$,$