Write a solution for Fibonacci using recursion.
Implement fibonacci(n) for a non-negative integer n. Return the nth Fibonacci number, where F(0) = 0 and F(1) = 1.
fibonacci(n)
n
F(0) = 0
F(1) = 1
def fibonacci(n):
Your question is Fibonacci Recursion. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
