Check if a string is a palindrome (reads same forward and backward) using recursion.
Input: "racecar"
Output: True
Input: "hello"
Output: False
Input: "a"
Output: True
Input: ""
Output: True
Think: a string is a palindrome if the first and last characters match, AND the middle part is a palindrome.