in python language 

2. Section #Prog Question 1 How to Attempt? Halindrome Given a string S, divide it into two equal parts S1 and S2. S is called a halindrome if at least any one of the following condition 1. S is a palindrome and length of S>=2. 2. S1 is a halindrome. 3. S2 is a halindrome. Your task is to find and return the number of halindromes in an array F Note: In the case of an odd length string, the middle element is not present in both middle element is m, then, S1 = S [0, m-1] and S2 = S [m+1, [S]-1]. Input Specification input 1: An integer value denoting the number of strings (1