input: Write a python function to calculate the nth Fibonacci number recursively.
  assert fibonacci(0) == 0
  assert fibonacci(1) == 1
  assert fibonacci(5) == 5
  assert fibonacci(10) == 55
output: def fibonacci(n):
      if n <= 1:
          return n
      return fibonacci(n - 1) + fibonacci(n - 2)