Problem
Write a recursive algorithm to check a sentence is palindromes (ignoring blanks, lower case and upper case differences, and punctuation marks, so that "Madam, I'm Adam" is accepted as a palindrome). Analyze the efficiency of your implementation and provide a detail discussion of its time complexity.