public class output{ public static int find (int a1, int a2) { if(a1==0) return(a1+1); else if(a1>0 && a2=%3D0) return 2 + find(a1-1,0); else return 1 + find (a2-1, a1); public static void main(String[] args) { int R = find(2,2); System.out.println(R); } %3D } // end of class

Identify the errors in the following code segment * provide the correction for each error. Import Java.util.scanner; public class Readable { public Static void main(String[] args) { Scanner KB ; int shares; double averagePrice = 14.67; Shares = KB.nextDouble(); System.out.println("There were " , shares + " shares sold at $" + averagePrice + " per share."); } }

a. Prompt the user to type a word on console and save the input into variable b. Implement recursive method(s) isPalindrome() to check if the given word is a palindrome and call it from the main(). c. Implement recursive method(s) theLength() to calculate the length of the given word (its number of characters) d. Display your results on console in the following format: "You word palindrome." consists of_ characters, this a e. Explain in comments the algorithms you use (how the recursion works, where is the base case, there is the recursive call(s), how you reduce the problem complexity).