input: Write a function to generate the nth Fibonacci number using a recursive approach. If n is 1 or 2, the function should return 1. For any other value of n, the function should 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)
  
  print(fibonacci(10))
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)