#include #include using namespace std; bool isBalanced(string expr) { stack s; char ch; for (int i=0; i > expr; if (isBalanced(expr)) cout < < Sorry,

#include

#include

using namespace std;

bool isBalanced(string expr) {

stack s;

char ch;

for (int i=0; i

if (expr[i]=='('||expr[i]=='['||expr[i]=='{') {

s.push(expr[i]);

}

else if (expr[i]==')'||expr[i]==']'||expr[i]=='}')

{

if (s.empty())

return false;

if (ch == ')' && s.top() == '(') {

s.pop();

}

else if (ch == ']' && s.top() == '[') {

s.pop();

}

else if (ch == '}' && s.top() == '{') {

s.pop();

}

else {

return false;

}

}

}

}

main() {

string expr;

cout << "Please, enter an expression with parentheses: " << endl;

cin >> expr;

if (isBalanced(expr))

cout << "Sorry, it is not Balanced!";

else

cout << "Cool beans, it is balanced!";

}

I need to implement my own Stack class. It should be a template so I can create stacks of any data type. Need to mplement the push, pop, top, empty, and clear member functions. So,I need help implement my stack class on coding that I am providing.

C++, simple coding helps me to understand bette