Write a recursive Python function that determines if a string S is a palindrome, that is, it is equal to its reverse. For example, racecar and madam are palindromes. The function will return True if the string is a palindrome and will return False if it is not.

b) Comment on the running time (using asymptotic notation) of your algorithm.