Directed Graphs and Network Flows · Challenge problem

Continue with capacities $c(s,a)=4$, $c(s,b)=2$, $c(a,b)=3$, $c(a,t)=1$, $c(b,t)=5$. Keep augmenting until no augmenting path is left. What is the maximum flow value?