Directed Graphs and Network Flows · Easy problem

In a flow network, arc $s\to b$ has capacity $4$ and arc $b\to t$ has capacity $3$, both carrying no flow. What is the bottleneck of the path $s\to b\to t$?