Write a recursive algorithm to determine whether a string is a palindrome. A string is a palindrome if it can be read forward and backward with the same meaning. Capitalization and spacing are...

Write a recursive algorithm to determine whether a string is a palindrome. A string is a palindrome if it can be read forward and backward with the same meaning. Capitalization and spacing are ignored. For example, anna and go dog are palindromes. Test your algorithm with the following two palindromes and at least one case that is not a palindrome. Madam, I’m Adam Able was I ere I saw Elba