This is for python

Part C In this part, you'll write a recursive version of the factorial function. Here, you'll write a function which: is named factorial recursive takes 1 argument: a positive integer returns 1 integer value: the result of the factorial Recall that O! is 1. If you would like to know why O! = 1 read below, otherwise skip this and continue to the solution. n! is a mathematical expression for the number of ways to arrange n items among themselves. In this case zero factorial is the number of ways that 0 items can be arranged, there is but one possible combination of how it can be arranged: it cannot. This still counts as a way of arranging it, so by definition, a zero factorial is equal to one, just as 1! is equal to one because there is only a single possible arrangement of this data set. Read Only import math np.random.seed (485) 1 = np.random.randint(0, 10) np.testing.assert_allclose(math.factorial(1), factorial_recursive(1)) np. testing.assert_allclose(1, factorial_recursive()) Read Only