How many base cases are required for the Fibonacci recurrence Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2}Fn=Fn−1+Fn−2?
222
000
111
333