input: Write a recursive Python function to generate Fibonacci numbers. Define the function with one parameter 'n', which represents the position in the Fibonacci sequence. The function should return the Fibonacci number at position 'n'. If 'n' is 1 or 2, the function should return 1. Otherwise, it should return the sum of the two preceding Fibonacci numbers. Verify the function with the following test case: print(fibonacci(10)).
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n-1) + fibonacci(n-2)