Question 19 1 pts Consider the following recursive definition of a method to calculate the factorial of a number: public int recursiveFactorial(int n) { int output = 1; if (n > 0) { output - n * recursiveFactorial (n-1); else if (n == 0) { output = 1; else { System.out.println("Bad input"); System.exit(); return output; What errors, if any, are there in the definition? The second stopping case is incorrect. o output is incorrectly initialized. o The recursive call is not tail recursion. The code is fine. The first stopping case is incorrect. Question 21 1 pts Which of the following has the highest algorithmic complexity? O 0(1) o O(n) (log n) o O(n log n) Question 22 1 pts Which of the available answers best describes what is wrong with the following method: public void writeVertical String(String input) { if (input.length)