Question $3.[5$ Marks$]$ Suppose that $G$ is a flow network where every vertex has out$-$degree at most $10$ and every capacity is at most $100.$ Argue that the Ford$-$Fulkerson algorithm runs in $O(|E|)$ time when given $G.$