recursive method countAlphabet

public class MyRecursion
{
    //driver method
    public static void main(String[] args)
    {
        //Example of a string to test with isPalindrome
        String str1 = "Malam";

        if( isPalindrome(str1))
        System.out.println("Word: " + str1 + " is a Palindrome");
        else
        System.out.println("Word: " + str1 + " is NOT a Palindrome");
    }//end main

    //isPalindrome method
    public static boolean isPalindrome(String str)
    {
        if (str.length() <= 1)
        return true;
        else
        {
            str = str.toLowerCase();
            char first = str.charAt(0);
            char last = str.charAt(str.length()-1);
            if (first == last )
            return isPalindrome(str.substring(1, str.length()-1));
            else
            return false;
        }
    }//end isPalindrome method
}//end class