Analyze the following recursive method.

```
public static long factorial(int n) {
return n * factorial(n - 1);
}```
a. Invoking factorial(0) returns 0.
b. Invoking factorial(1) returns 1.
c. Invoking factorial(2) returns 2.
d. Invoking factorial(3) returns 6.
e. The method runs infinitely and causes a StackOverflowError.

e