input: Write a function to generate Fibonacci numbers recursively. The function should take an integer `n` as input and return the nth Fibonacci number. Fibonacci sequence starts with 1, 1, and each subsequent number is the sum of the two preceding ones.
  def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)
  
  print(fibonacci(10))
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)