Question: 
Write a function to solve the fibonacci sequence using recursion.


Model's Code:
def fibonacci(n):
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)



Sample Correct Code:
def fibonacci(n):
  if n == 1 or n == 2:
    return 1
  else:
    return (fibonacci(n - 1) + (fibonacci(n - 2)))


Asserts:
assert fibonacci(7) == 13
assert fibonacci(8) == 21
assert fibonacci(9) == 34


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 873 of 974: 671/873 (76.86139747995419%): success