Python challenge_11

def palindrome(string):    pal_string = list( string.casefold() )    rev_string = list( reversed(pal_string) )    if pal_string == rev_string:        return True    else:        return Falseprint(palindrome("aba"))

def palindrome(string):    while len(string) > 1:      head = string[0]      tail = string[-1]      string = string[1:-1]      if head != tail:        return False    return True

def palindrome(string):  if len(string) < 2:    return True  return string[0] == string[-1] and palindrome(string[1:-1])

def palindrome(string):  return string == string[::-1]