GIVE STEP BY STEP ILLUSTRATION

Ford Fulkerson algorithm takes a graph $G=(v,e,s,c,t)$ as input and returns a maximum flow

$15$

from the source vertex to the target vertex. Here $\text{'}s\text{'}$ is the source vertex, $\text{'}t\text{'}$ is the target vertex, $\text{'}c\text{'}$ is the function representing the capacity of edges $\text{'}e\text{'}$ and $\text{'}v\text{'}$ is the set of vertices. Execute the Ford$-$Fulkerson algorithm on the given below graph $G$ and determine a maximum$-$value flow. For every iteration of the algorithm, draw the residual graph and show the flow augmenting path and the amount of flow that is used to augment the previous flow.

Rubrics:

Logic $(3$ marks$),$ Illustration $(5$ marks$),$ Pseudocode$(5$ marks$),$ Running time & TimeComplexity $(2$ Marks$)$