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.