Recursive method to find fibonacci numbers

fibonacci.py

def fibonacci_recursive(i: int = None) -> int:
    """
    The simplest way to calculate a fibonacci number, using recursion.
    Simple works, but not in all cases!

    >>> fibonacci_recursive(20)
    6765
    >>> # fibonacci_recursive(100) No, don't do this, it will take forever and exhaust your computer's memory
    """
    if i == 0:
        return 0
    if i == 1:
        return 1
    return fibonacci_recursive(i - 1) + fibonacci_recursive(i - 2)