Implement palindrome check recursively. A palindrome reads the same forward and backward.
Your function takes a string and returns True if it's a palindrome, False otherwise.
Requirements:
- Compare first and last characters
- If they match, check if the middle is a palindrome
- Base case: empty string or single character is a palindrome
- Handle case sensitivity as specified
Examples:
"racecar"->True"hello"->False"a"->True""->True
Think: the string is a palindrome if s[0] == s[-1] and s[1:-1] is also a palindrome.