For the Questions Below, Refer to the Following Recursive Factorial

Multiple Choice

For the questions below, refer to the following recursive factorial method.
public int factorial(int x)
{
if (x > 1) return x * factorial (x - 1) ;
else return 1;
}
-How many times is the factorial method invoked if originally called with factorial(5) ? Include the original method call in your counting.

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