By convention, 0! is defined as 1. The factorial is undefined for negative n.

The following Python code implements a recursive algorithm for solving the factorial problem:

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

Identify the following parts of the code and explain your answers:

Base Case Recursive Step Inductive Step Reduction Step

Describe why the factorial problem might be better solved by a non-recursive algorithm.