When computing $fib(8)$ using the naive recursive definition $fib(n) = fib(n-1) + fib(n-2)$ with $fib(0) = 0$ and $fib(1) = 1$, what is the maximum recursion depth (where the initial call has depth 0)?