(Solved) : Outcomes Implement Stack Using Array Implement Algorithm Convert Infix Expressions Postfix Q32563236 . . . .

Outcomes:

Implement a Stack using an array

Implement an algorithm to convert infix expressions into postfixexpressions

Implement an algorithm to evaluate postfix expressions

Naming requirements (not following any of these may result in ascore of 0):

The Eclipse project name must be Project4.

You will have exactly four source code files:StackInterface.java (an interface you areprovided), ArrayStack.java (your array-basedimplementation of StackInterface),InfixExpression.java, andTester.java

You will use the default package (this meansthere should be no package statements in any of your files).

Preliminaries:

Review the algorithms in chapter 5 for:

Determining whether parentheses in an algebraic expression arebalanced correctly

Converting an infix expression to a postfix expression

Evaluating a postfix expression

Read chapter 6 to understand