write a java program that determine if a string is a palidrome using a recursive method and a non-recursive method (ignore characters that are not letters). Then write a driver to test the two versions of the two methods. (A palindrome is a string that reads the same forward as well as backward. For example, “otto” and “never odd or even” are palindromes) (driver can be hard coded)

Exercise 1Write a Java method random that generates and returns a random number between 14 and 59(using SecureRandom). Test your method several times using a main function

write a code in java (using recursion)

Please explain the questions related to the code below:   //1. Why is 20 printed 3 times and why does it start with 1, but end with 2? //2. What is the base case for this recursive method and why?             //3. How would you implement this using a loop? //4. What is each if statement checking?             //5. Would a solution to this using loops require more or less code and would it be more or less effecient? //6. Why is recursion a good choice to solve this problem? //7. How can recursion become infinite?             //8. When is recursion appropriate?     /* Load the code below into a cloud compiler and run each method one at a time by removing the comments for the method. Walk through the code as a group and explore how the code works. Submit the answers to the numbered questions for credit. */   public class DemoRecur {             //Simple statement designed to show control flow in recursion             public static void printDemo(int x, int max)             {…

help create a Java recursive method that determines if a number is a prime number

java