Write a program using a combination of Stack and Queue to test to see if a word is a palindrome. The program (algorithm) MUST BE NON-Recursive. prompt the user for an input word and store it in both a Queue and a Stack. Then pop a character at a time from the Stack and Queue and and match them. If they all match, then return TRUE else return FALSE. They must implement short circuiting i.e. if there is no match, immediately return FALSE. must repeatedly run the program until the user enters "n " or "N" to stop the program.

Need help in java. Please show results and explain.