Recursion in Python

Let's go back to our function for finding the factorial:

def recursive_factorial(n):
    # negative numbers have no factorials
    if n < 0:
        print("no solution")
    # base case
    elif n == 0:
        return 1
    # recursive case
    else:
        return n * recursive_factorial(n - 1)

In the situation when the function is asked to compute $4!$

recursive_factorial(4)

what would be the order of the function calls?