input: Write a python function to calculate the nth Fibonacci number using recursion.
  assert getFibonacci(1) == 0
  assert getFibonacci(2) == 1
  assert getFibonacci(8) == 13
  assert getFibonacci(10) == 34
output: def getFibonacci(n):
      if n <= 0:
          return 0
      elif n == 1:
          return 0
      elif n == 2:
          return 1
      else:
          return getFibonacci(n-1) + getFibonacci(n-2)