Given the following flow network from v$0($source$)$ to v$7($sink$),$ use the Ford$-$Fulkerson

algorithm to determine the maximum flow. Provide the resulting flow, and draw and label

the flow network and residual network.

Edge list:

$\{(v0,v1,1),(v0,v2,3),(v0,v3,3),(v1,v6,4),(v2,v1,2),(v2,v5,1),(v3,v2,3),(v3,v4,2),(v4,v7,4),$

$(v5,v1,5),(v5,v4,3),(v5,v7,3),(v6,v2,3),(v6,v5,2),(v6,v7,3)\}$