Consider the weighted directed graph $G_3=(V_3,E_3)$ given in Figure $3$

Figure $3$: The weighted directed graph $G_3.$ Edge labels give capacities of each arc.

$($a$)$ Use the Ford$-$Fulkerson algorithm to find the maximum flow with $s=0$ and

$t=5.$

You may assume that the edge labels indicate the capacity of each edge and

that the initial flow $x$ assigns the value $0$ to each edge.