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