The factorial of a non-negative integer is the product of that integer and all of the non-negative integers less than it. The factorial of zero is equal to 1. Factorial is not defined for negative numbers. Consider this method that defines factorial recursively. Which of the following conditions could fill in this blank and allow the recursive method to terminate correctly?
n == 0 n == 1 n < 0 n<1
CODE:
public static int factorial(int n) {
boolean terminate = ;
if (terminate) {
return 1;
}
return n * factorial(n - 1);
}