Please don't forget to show residuals... needed for the Ford Fulkerson method For the network shown, we need to find the maximum flow from the source (s₀) to the sink (sᵢ). Additionally, identify a cut whose capacity equals the maximum flow in this network. Ensure that the Ford-Fulkerson method is demonstrated correctly in your solution.### Network Details:- **Vertices:** The network consists of five nodes: s₀ (source), 1, 2, 3, 4, and sᵢ (sink).- **Edges and Capacities:** - From s₀ to 1: Capacity = 4 - From s₀ to 2: Capacity = 6 - From 1 to 3: Capacity = 6 - From 1 to 2: Capacity = 4 - From 2 to 4: Capacity = 2 - From 3 to sᵢ: Capacity = 6 - From 4 to sᵢ: Capacity = 2 - From 1 to 4: Capacity = 2 - From 3 to 4: Capacity = 1### Graph Explanation:The graph is a directed network flow graph with vertices and directional edges representing pathways from the source to the sink. The numbers on each edge denote the maximum capacity for flow along that edge. To solve the problem, one must employ the Ford-Fulkerson method to systematically find augmenting paths and determine the maximum flow and minimum cut.

The Ford-Fulkerson algorithm is used to detect maximum flow from start vertex to sink vertex in given graph. paths are, so-1-3-si=4+6+6=16 so-2-4-si=6+4+2=12so-2-1-4-3-si=6+4+2+1+6=19so-2-1-3-si=6+4+6+6=22 so-1-4-3-si=4+2+1+6=13 so-1-4-si=4+2+2=8 so-2-4-3-si=6+4+1+6=17 Maximum flow from source to sink is Source-2-1-3-sink whose capacity is equal to maximum flow of network i.e. 22