Analyze the following recursive method. public static long factorial(int n) { return n * factorial(n - 1); } Select one: Invoking factorial(O) returns 0. Invoking factorial(1) returns 1. Invoking factorial (2) returns 2. The method runs infinitely and causes a Stack OverflowError. Invoking factorial(3) returns 6