please solve this question using java

Write the static method isPalindrome, which takes a String and tells whether that string is a one-word palindrome. Your solution must use a Stack to help solve the problem (little to no credit will be given for a solution that doesn't use a Stack). For full credit, your solution is only allowed to traverse the String once. The string does not have to be a real English word, but it must read the same forwards and backwards to be considered a palindrome. Hint: unlike the solution discussed in class, this one will not involve recursion. See code handout for Stack interface Examples: word "the" return value of call to isPalindrome (word) false true true true false "radar" "abccba" "abcbca" "abccbaafalse "yay" "Yay" true false true true true (upper and lower case characters are not considered the same for this problem) // returns true iff the word given is a palindrome public static boolean isPalindrome (String word)