Problem $2.$

$[10$ marks$]$

Find the maximum flow in the flow network shown in figure $1$ using Ford$-$Fulkerson algorithm. In the flow network $\text{'}$ s $\text{'}$ is the source vertex and $\text{'}$ t $\text{'}$ is the destination vertex. The capacity of each. of the edges are given in the figure. explain in details with this graph and give me answer