Q5. Write a recursive function to check if a string is a palindrome. A string is considered a palindrome if it reads the same forwards and backwards. For example, "racecar" and "level" are palindromes ...

A string is a palindrome when it is the same when read backwards. For example, the string "bob" is a palindrome. So is "abba". But the string "abcd" is not a palindrome, because "abcd" != "dcba".