Given a word, use a recursive solution to determine if it's a palindrome. Return True if it's a palindrome or False if it's not. Return True for a zero-length word. Do not use negative skip-slicing to reverse the word. You may assume that all characters are lower case.