Task $3$

Write a MATLAB program that uses the Ford$-$Fulkerson algorithm to calculate the maximum flow of a any network. Divide your code into reasonable Sections and comment on their functionality. Your program should meet the following specifications:

After each iteration:

Output the current flow of all edges.

Output of the current total flow at the sink

After convergence:

Output of the required iterations.

Output of the optimal flow of all edges

Output of the optimal total flow at the sink