Directed Graphs and Network Flows · Challenge problem

A flow network has source $s$, sink $t$, and vertices $a,b,c,d,e$ in between, with capacities $c(s,a)=9$, $c(s,b)=7$, $c(a,c)=4$, $c(a,d)=3$, $c(b,d)=4$, $c(b,e)=6$, $c(c,d)=2$, $c(d,e)=3$, $c(c,t)=6$, $c(d,t)=2$, $c(e,t)=7$. What is the maximum flow from $s$ to $t$?