Example Code Ch 12-2

Multiple Choice

Example Code Ch 12-2
Given the following recursive factorial method:
public int factorial(int x)
{
if (x > 1) return x * factorial (x - 1) ;
else return 1;
}
-Refer to Example Code Ch 12-2: How many times is the factorial method called with factorial(5) ? Include the original method call in your counting.

A) 1
B) 4
C) 5
D) 6
E) 7