Demonstrate a recursive solution to calculate the factorial of a number

Recursion is simply calling a function within itself, this allows for smaller and more implicit code, effective for larger projects.The factorial of a number e.g. 4!Would be 1234, and the python code would:Def recursiveF(X): If X==1: Return (1) Else: X = XrecursiveF(X-1)Print (recursiveF(4))
The code above checks for if the parse is 1 if not it would times the current number with the number before it, due to the IF ELSE statement we introduced a terminator clause.