What is the time complexity for this function?

 

def count_all_palindrome(s): 1 = len (s) res = 0 for start in range(1-2): for end in range (start + 1, 1): is_palindrome = True this sts[start:end + 1] this_1 = len(this_st) for i in range(this_l): is_palindrome = is_palindrome and (this_st[i] res += is_palindrome return res == this st[this 1 - 1 -i])