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);
}

Multiple choice project create a program with two multiple choice questions. 1. users have two attempts only, show attempt number each time. hint: while loop with break control. (20%) 2. only one correct answer for each question, use switch case for each question. (20%) 3. show total score after the two questions are answered. hint: . (20%) 4. user have options to answer the two questions again if first attempt score is not 100%. hint: if statment. (20%) 5. use string method .toupper() to allow users to enter with lowercase or uppercase letters. (20%) 1. where is the capital of the state of florida? a. orlando b. tallahassee c. miami d. tampa b 2. where is walt disney world park located in florida? a. orlando b. tallahassee c. miami d. tampa a