Need a help with a Python problem:

Write a recursive function isPalindrome() that takes a string representing a word path. It determines if the word is a palindrome or not. If it is, it returns True. If it is not, it returns False. CLUES: For a word to be a palindrome, it must spell the same word both forward and in reverse. This means you can compare the first and last characters. If they are not the same then this is not a palindrome. This means the base case is when the length is less than or equal to 1. And, it means the way you work towards the base case is to slice off both the leading character and the last character in the string for the recursive call.

This is what is given:

def isPalindrome(s):

if len(s)

elif pass

else: pass

is Palindrome abccba True is Palindrome abcdef False is Palindrome noon') True is Palindrome civic True