The previous program for palindrome required that each character of the string have a matching character in the same position but starting from the other end. But most popular palindromes involve punctuation, spaces, and capitalization that is ignored. So, for instance, the following are all palindromes under this extended definition: Ah! Satan sees Natasha. Eva, can I see bees in a cave? Was it a car or a cat I saw? Write a math-like definition for this extended idea of palindrome, and write a program that implements and tests it. You will need to add two more recursive cases to the definition of palindrome. You will find the methods isLetterorDigit() and toLowerCase() from the class Character very useful. (This program might prove to be difficult.) Click here to go back to the main menu