C++

Coding exercise 1 - Implement a stack using arrays Create a template called arrayStack that implements a stack using an array in a file called arrayStack.h. The template should have the functionalities of push, pop, top, size, maxSize, and empty as described in the lecture. Implement the algorithm to convert an expression from infix to postfix using your array stack The algorithm to convert from infix expression to postfix expression is available in the textbook. A handout also contains the pseudocode if you would like to verify your algorithm. I do not encourage directly using the algorithm without attempting to write it out yourself first. Name your source file myInfixPostfix.cpp. Assume that you only have operators,.1 Test cases you can use A+B-C (A+B)*C A+B (C D) E/F G+H