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

Outcomes: • Implement a Stack using an array • Implement analgorithm to convert infix expressions into postfix expressions •Implement an algorithm to evaluate postfix expressions Namingrequirements (not following any of these may result in a score of0): ● The Eclipse project name must be Project4. ● You will haveexactly four source code files: StackInterface.java (an interfaceyou are provided), ArrayStack.java (your array-based implementationof StackInterface), InfixExpression.java, and Tester.java ● Youwill use the default package (this means there should be no packagestatements in any of your files). Preliminaries: Review thealgorithms in chapter 5 for: ● Determining whether parentheses inan algebraic expression are balanced