Part One:

Write a program that implements the Ford$-$Fulkerson method given the graph shown below:

Diagram from Mark Allen Weiss Data Structures & Algorithm Analysis in C$++$

Part Two:

Create your own graph that is larger $($your discretion$)$ than the graph above. Apply the Ford$-$Fulkerson

method to your graph

Extra Credit $(+15\%$ :

The above method may fail in certain conditions. Identify what those conditions are in detail and

implement a solution to account for it$.$ Note: you will only receive credit if you also identify the

conditions in detail, not just for the implementation. Hand

$-$

in:

$1.$

The code used to complete the task

$($no zip files$)$

$.$

$2.$

The

output

demonstrating the

Ford

$-$

Fulkerson algorithm

on both graphs

$3.$

$($Optional$)$ A word document or PDF containing the answer to the extra credit question.

using python code implement this