Create a stack based program StackMath that accepts a user's infix or postfix expression string and displays it in the other notation along with an evaluation of this expression $($hint: see textbook sections $5\mathrm{.}16,5\mathrm{.}18$ and $5\mathrm{.}21).$ Also necessary is StackInterface.

Your program will contain the following methods, which may be in separate classes:

infix$2$postfix $$ converts infix to postfix

postfix$2$infix $$ converts postfix to infix

evaluatePostfix $$ evaluates the postfix expression $($using a stack$)$

evaluateInfix $$ evaluates the postfix expression $($using a stack$)$

Have your program allow the user to optionally use the classes:

LinkedStack, as outlined in Listing $6-1$

ArrayStack, as outlined in Listing $6-2$

Each of the above classes include these ancillary methods, at least:

pop

push

peek

isEmpty

clear

Within LinkedStack's comments, explain if toArray is should be included. Include it if so$.$

Within ArrayStack's comments, explain if toArray is should be included. Include it if so$.$

Program displays correct infix expression of user's postfix expression.

Program displays correct postfix expression of user's infix expression.

Program properly evaluates user's infix expression, displaying the correct result.

Program properly evaluates user's postfix expression, displaying the correct result.