fib(0)=0, fib(1)=1, fib(n)=fib(n-1)+fib(n-2). Predict the value, count recursive calls, or compare approaches!