input: Write a recursive function to generate Fibonacci numbers. The function should take an integer \( n \) as input and return the \( n \)-th Fibonacci number. 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. Provide an example where the function is tested with the input 10.
  
  
  def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)
  
  assert fibonacci(10) == 55
  
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)