input: Write a function to generate Fibonacci numbers using a recursive Python function. If the input is 1 or 2, return 1. Otherwise, return the sum of the previous two Fibonacci numbers. 
  
  def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)
  
  assert fibonacci(10)==55
  assert fibonacci(5)==5
  assert fibonacci(1)==1
  assert fibonacci(2)==1
  assert fibonacci(6)==8
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)