Directed Graphs and Network Flows · Easy problem

In a flow network, the path $s\to a\to b\to t$ has arcs of capacity $6$, $2$ and $5$ respectively, and carries no flow yet. What is the bottleneck (the most flow that can be pushed along this path) of $s\to a\to b\to t$?