Question

For the question below, refer to the following recursive factorial method.

Answer 1

Answer:

B) (x<=1)

Explanation:

Though this code given will run perfectly without any requirement of base case.But still we have to include a base case I will suggest (x<=1) because the value of x is decreased by one at each recursive call so it can handle it very well and it can handle negative values of x also if user enters it by mistake since factorial is for positive numbers only.