Write a Java program that uses a stack to test whether an input string is a palindrome. Exercise 11 defines “palindrome” and asks you to describe a solution to this problem.

Exercise 11- A palindrome is a string of characters (a word, phrase, or sentence) that is the same regardless of whether you read it forward or backward—assuming that you ignore spaces, punctuation, and case. For example, Race car is a palindrome. So is A man, a plan, a canal: Panama. Describe how you could use a stack to test whether a string is a palindrome.

Define a class Postfix that includes the static methods convertToPostfix and evaluatePostfix. These methods should implement the algorithms given in Segments 5.16 and 5.18, respectively. Assume that the given algebraic expressions are syntactically correct. The standard class StringBuilder, which is in the Java Class Library and is described in Segment A.79 of Appendix A, will be helpful.