SOLVE USING JAVA

Given the following program: public class RecursionPractice 1 public static void main (String args[]) { boolean ispalindrome; //catches the result of palindrome String word; //String to be sent to palindrome word = "kayak"; isPalindrome = palindrome (word); //call to subroutine palindrome System.out.println (isPalindrome); //true if String word is a palindrome word = "civic"; isPalindrome = palindrome (word); //call to subroutine palindrome System.out.println (isPalindrome); //true if String word is a palindrome word = "hello"; isPalindrome = palindrome (word); //call to subroutine palindrome System.out.println (isPalindrome); //true if String word is a palindrome } Given a non-empty String, recursively determine if it is a palindrome (text that reads the same backwards as it does forwards). Return true if it is a palindrome, otherwise return false. Examples: palindrome (kayak) -->true palindrome (civic) -->true palindrome (hello) -->false public static boolean palindrome (String str) { //your code goes here } } Your job is to complete the palindrome method according to its description. Do not change the main method. Do not change the subroutine definition