fibonacci-recursive-worst-solution.py

def fibonacci(n: int) -> int:
    if n <= 1:
        return 0
    elif n == 2:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


for i in range(6):
    print(fibonacci(i))