#include

using namespace std;

const int MAXSIZE = 10;

// This class defines a template stack ADT instantiated with a static array

// modify the class and function declarations

template

class Stack {

public:

Stack();

bool peek(int &topElement) const;

bool push(int toIns);

bool pop(int &delElement);

bool isEmpty() const;

void makeEmpty();

private:

int elements[MAXSIZE];

int top;

};

// add your own function implementation here

// remember to modify the function headers as needed

Stack::Stack()

{

// replace this code

top == 0;

}

bool Stack::isEmpty() const

{

// replace this code

return true;

}

bool Stack::peek(int &topElement) const

{

// replace this code

return false;

}

bool Stack::pop(int &delElement)

{

// replace this code

return false;

}

bool Stack::push(int toIns)

{

// replace this code

return false;

}

void Stack::makeEmpty()

{

}

int main()

{

Stack myIntStack;

cout

cout

cout

cout

for (int i = 0; i

if (myIntStack.push(i))

cout

else

cout

}

cout

cout

cout

int itopElement = 0;

if (myIntStack.pop(itopElement))

cout

else

cout

if (myIntStack.pop(itopElement))

cout

else

cout

cout

cout

cout

if (myIntStack.isEmpty())

cout

else

cout

cout

cout

cout

if (myIntStack.peek(itopElement))

cout

else

cout

cout

cout

cout

myIntStack.makeEmpty();

if (myIntStack.isEmpty())

cout

else

cout

Stack myCharStack;

cout

cout

cout

cout

for (char i = 'a'; i

if (myCharStack.push(i))

cout

else

cout

}

cout

cout

cout

char topElement = ' ';

if (myCharStack.pop(topElement))

cout

else

cout

if (myCharStack.pop(topElement))

cout

else

cout

cout

cout

cout

if (myCharStack.isEmpty())

cout

else

cout

cout

cout

cout

if (myCharStack.peek(topElement))

cout

else

cout

cout

cout

cout

myCharStack.makeEmpty();

if (myCharStack.isEmpty())

cout

else

cout

return 0;

}

Download the file stack template.cpp from the Blackboard (Knowledge) and use it to write a C++ program that will implement the infix to postfix conversion algorithm shown below. .Read the current token. If the token is a Push to stack append it to the postfix expression pop the stack and append to postfix expression, until we pop a ('. DO -number NOT append the ( - operator while the top of the stack is an operator with precedence greater than or equal to current tokern pop stack and append to postfix expression push the operator onto the stack Advance read pointer