Consider the recursive function $T(n) = 3T(n-1)$ with base case $T(0) = 1$. In the recursion tree for computing $T(4)$, how many leaf nodes (base cases) are reached?