input: Write a python function to compute the Fibonacci sequence of numbers up to 10 terms using a recursive method.
  assert fibonacci(0) == 0
  assert fibonacci(1) == 1
  assert fibonacci(10) == 55
output: def fibonacci(n):
      if n <= 0:
          return 0
      elif n == 1:
          return 1
      else:
          return fibonacci(n-1) + fibonacci(n-2)