Code in JAVA

public interface Stack { /** * Returns the number of elements in the stack. * @return number of elements in the stack */ int size();

/** * Tests whether the stack is empty. * @return true if the stack is empty, false otherwise */ boolean isEmpty();

/** * Inserts an element at the top of the stack. * @param e the element to be inserted */ void push(E e);

/** * Returns, but does not remove, the element at the top of the stack. * @return top element in the stack (or null if empty) */ E top();

/** * Removes and returns the top element from the stack. * @return element removed (or null if empty) */ E pop(); }

A palindrome is a word, phrase, or sentence that reads the same backwards as forwards (with punctuations ignored). For example, A man, a plan, a canal: Panama. is a palindrome. King, are you glad you are king? is not a palindrome Implement the generic Arraystack that we discussed in class and include a toString method. The Stack interface of our ADT is provided. Create a driver class that declares a Stack as an instance of Arraystack and use it to see if a word or phrase entered by the user is a palindrome. Refer to the algorithm for reversal that we discussed in class but do not use this generic method. Declare and use the stack in main. Display the result of the palindrome test. For example, Enter a word, phrase, or sentence: A man, a plan, a canal: Panama. is a palindrome