For this Question: Palindrome is a word, phrase, or sequence that reads the same backwards as forwards. Use recursion to check if a given string is palindrome or not.User Task:
Since this is a functional problem, you don't have to worry about the input, you just have to complete the function check_Palindrome() where you will get input string, starting index of string (which is 0) and the end index of string( which is str.length-1) as argument.

Constraints: 
1 ≤ T ≤ 100
1 ≤  N ≤ 10000Return true if given string is palindrome else return falseSample Input 
2
ab
aba

Sample Output
false
true, I have written this Solution Code:   
    static boolean check_Palindrome(String str,int s, int e) 
    { 
        // If there is only one character 
        if (s == e) 
            return true; 
  
        // If first and last  
        // characters do not match 
        if ((str.charAt(s)) != (str.charAt(e))) 
            return false; 
  
        // If there are more than  
        // two characters, check if 
        // middle substring is also 
        // palindrome or not. 
        if (s < e + 1) 
            return check_Palindrome(str, s + 1, e - 1); 
  
        return true; 
    }
    , In this Programming Language: Java, Now tell me if this Code is compilable or not?