Consider a recursive function $f(n) = 2f(n-1) + 1$ with $f(0) = 0$. How many total function calls (including the original call to $f(5)$) are made during the computation of $f(5)$?