input: Write a function to generate Fibonacci numbers using a recursive approach in Python. The function should take an integer `n` as input and return the `n`-th Fibonacci number. The Fibonacci sequence starts with 1, and each subsequent number is the sum of the previous two numbers. If `n` is 1 or 2, the function should return 1.
  assert fibonacci(10)==55
  assert fibonacci(1)==1
  assert fibonacci(2)==1
  assert fibonacci(5)==5
  assert fibonacci(7)==13
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      return fibonacci(n-1) + fibonacci(n-2)