Recursionhard
0:00.0

Compute F9F_9 where the Fibonacci sequence is defined by F0=0F_0 = 0, F1=1F_1 = 1, and Fn=Fn1+Fn2F_n = F_{n-1} + F_{n-2} for n2n \geq 2.