Implement the Fibonacci function recursively. Each number is the sum of the two before it.
The sequence:
Your function takes and returns the th Fibonacci number (0-indexed).
Requirements:
fib(0)=fib(1)=fib(n)=fib(n-1)+fib(n-2)for
Examples:
fib(0)->fib(5)->fib(10)->
Note: This naive recursion is slow for large because it recomputes the same values many times. You'll learn to fix this with memoization.