I. Write the recursive equation `(T(n))`

for the run time
of the following function:

def factorial(n): if n == 0: return 1 else: return n * factorial(n-1)

II. Solve the above equation `(T(n))`

in terms of `n`

.

III. Find the answer for `factorial(5)`

by drawing a stack method.