find the maximun flow from node $1$ to node $6$ by augmenting path algorithm.$($ all numbers on arcs are the capacities.$)$ use max$-$flow$/$min$-$cut theorem to support your solutioon ESI$4312$

Exam $3$

Fall $2023$

$2.[30$ points$]$ Find the maximum flow from node $1$ to node $6$ by augmenting Path algorithm. $($All numbers on arcs are the capacities.$)$ Use max$-$flow$/$min$-$cut theorem to support your solptinn