42. Fill in the code to complete the following method for checking whether a string is a palindrome. public static boolean isPalindrome(String s) t if (s.length) 1)//Base case return true; else if return false; else return isPalindrome(s.substring(1, s.length0-1) a. (s.charAt(O) l- s.charAt(s.length)-1))//Base case b. (s.charAt(0) l s.charAt(s.lengthO)// Base case c. (s.charAt(1) I= s.charAt(s.length()-1)) // Base case d. (scharAt(1) ls.charAt(s.length(0)//Base case 43. Which of the following statements is false? a. Recursive methods run faster than non-recursive methods. b. Recursive methods usually take more memory space than non-recursive methods. c. A recursive method can always be replaced by a non-recursive method. d. In some cases, however, using recursion enables you to give a natural, straightforward, simple solution to a program that would otherwise be difficult to solve. 44. Analyze the following code: public class Test f public static void main(Stringl) args) int) x (1, 2, 3,4, 5) xMethod(x, 5): public static void xMethod(int) x, int length) System.out.print+x[length- 1) xMethod(x, length-1) a. The program displays 1 2 3 46. b. The program displays 1 2 3 4 5 and then raises an ArrayindexOutOfBoundsException. c. The program displays 54321 d. The program displays 5 4 3 2 1 and then raises an ArrayindexOutofBoundsException. as Fill in the code to complete the following method for checking whether a string is a palindrome public static boolean isPalindrome(String s) return isPalindromels, o, s.length)-1) public static boolean isPalindrome(String s, int low, int high) if (high low)// Base case return true; else if (s.charAt(low)I- s.charAt(high)// Base case return false; else return a. isPalindrome(s) b. isPalindromels, low, high) c. isPalindrome(s, low +1, high) d. isPalindrome(s, low, high 1) e. isPalindrome(s, low+1, high- 1) 46. Show the output of the following code public class Test1 public static void main(Stringl) args) f System.out.printin(f2(2,O)) public static int f2(int n, int result) ( if (n0) return 0; else return f2(n -1, n+ result) a. O b. 1 c. 2 d. 3