Makw a function called palindrome that would take in a string and tell you if its the spelt the same forwards and backwards. Rewrite this function, but this time check recursivly. [30 marks] Hint: a word is a palindrome if the first and last letters are equal and the inside of the word is also a palindrome. Make sure you use recursion for the computation. An iterative solution will result in docked marks.