Computational Thinking and Recursion Quick Check 5 of 55 of 5 Items Question The following code is for a Python function to represent a recursive function to find the factorial of an integer def factorial(x): if x == 1: return 1 else: return (x * factorial(x-1)) num = 3 print("The factorial of", num, "is", factorial(num)) Which code reflects the recursive case? (1 point) Responses else: return (x * factorial(x - 1)) else: return (x * factorial(x - 1)) print("The factorial of", num, "is", factorial(num)) print("The factorial of", num, "is", factorial(num)) if x == 1: return 1 if x == 1: return 1 num = 3 num = 3 Skip to navigation page 14 of 14

Answer 1

The recursive case in the provided Python function for calculating the factorial is:

else: return (x * factorial(x - 1))

This part of the code represents the recursive step, where the function calls itself with a decremented value of x until it reaches the base case (when x == 1).