Question VI (15 pts): Design a function that accepts a string as an argument. Assume that the string will contain a single word. The function should use recursion to determine whether the word is a palindrome (a word that reads the same backwards as forward). Hint: Use string slicing to refer to and compare the characters on either end of the string. At each recursive call, print the parameters of the recursive method call