A sequence satisfies $a_n = a_{n-1} + a_{n-2}$ with $a_0 = 0$ and $a_1 = 1$. How many total function calls (including the initial call) are made when computing $a_5$ using naive recursion?