A palindrome is a word or phrase that reads the same forward and backward. For example, "racecar" is a palindrome. Determining whether or not a string is a palindrome is a great candidate for a recursive algorithm. Write a program that uses recursion to determine whether or not a given string is a palindrome. 1. Prompt the user to type a sentence 2. Use recursion to determine whether or not the given string is palindrome - Ignore white space, punctuation, and capitalization. E.g. "Sit on a potato pan, Otis!" is considered a palindrome. 3. Print a message with the result.