How to write a recursive method called palindrome and a non-recursive method called palindromenonrecursive in java that determine if a string is a palidrome (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)

I need help creating a code below   -  Write a recursive method called digitCount() that takes a positive integer as a parameter and returns the number of digits in the integer. Hint: The number of digits increases by 1 whenever the input number is divided by 10. Ex: If the input is: 345 the method digitCount() returns and the program outputs: 3

Write a method called drawDiamond() that outputs lines of '*' to form a Diamond with equal length diagonals. Method drawDiamond() has one parameter, an integer representing the diagonal of the diamond. Assume the diagonal length is always odd and less than 20. Output 9 spaces before the first '*' on the first line for correct formatting. Either drawTriangle or at least one of its helper methods must be recursive. Ex: If the input of the program is: 3 the method drawDiamond() outputs:  * ***  * Ex: If the input of the program is: 15 the method drawDiamond() outputs:        *       ***      *****     *******    *********   ***********  ************ ***************  *************   ***********    *********     *******      *****       ***        * Note: the diamond is made up of a rightside up triangle and an upside down triangle.       import java.util.Scanner; public class LabProgram {      /* TODO: Write drawDiamond() method here. */   /* You can add other helper methods if needed…

Use java and correctly indent code.