input: Write a function to generate Fibonacci numbers using a recursive approach by specifying the number of terms to generate. Return the nth Fibonacci number where n is the parameter. If n is less than or equal to 0, return 0.
  def fibonacci(n):
      if n <= 0:
          return 0
      elif n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)
  print(fibonacci(10))
  assert fibonacci(1)==1
  assert fibonacci(5)==5
  assert fibonacci(10)==55
  assert fibonacci(-1)==0
  assert fibonacci(0)==0
output: def fibonacci(n):
      if n <= 0:
          return 0
      elif n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)