What is the Ford Fulkerson algorithm and how is it used to solve the maximum flow problem?

The Ford-Fulkerson algorithm is a method used to find the maximum flow in a network. It works by repeatedly finding augmenting paths from the source to the sink, increasing the flow along these paths until no more paths can be found. This process is repeated until no more augmenting paths can be found, at which point the maximum flow is reached.