in python Which would be the base case in a recursive solution to the problem of finding the factorial of a number. Recall that the factorial of a non-negative whole number is defined as n! where: If n = 0, then n! = 1 If n > 0, then n! = 1 x 2 x 3 x ... x n

		n = 1
		n > 0
		n = 0
		The factorial of a number cannot be solved with recursion.