#include using namespace std; #define MAX 1000 //Maximum size of stack  class Stack{    int top;// to store top of stack    public:    int elements[MAX]; //Integer array to store elements    Stack(){ //class constructor for initialization         top=-1;    }     bool push(int x) {          if(top>=(MAX-1)) //Condition for top when stack because full          {               cout<<"Stack is full\n";                return false;           }          else           {            ++top; //Increasing top value             elements[top]=x; //storing it to element in to stack             return true;             } } int pop(){      if(top<0)// Condition for top when stack is empty      {       cout<<"stack is empty\n";       return INT_MIN;       }       else       {          int x=elements[top--];//poping out the element for stack by decreasing to element          return x;        } } int  display(){ if(top<0)//Condition for top when stack is empty    {       cout<<"Stack is empty\n";       return INT_MIN;     }     else{            for(int i=0;i<=top;i++)//running loop from start to top and printing elements                      cout<>ch; if(ch==1){   int x;   cout<<"Enter an integer element to push:\n";   cin>>x;      mystack.push(x); } else if(ch==2){   int x=mystack.pop();   if(x!=INT_MIN)      cout<<"Element"<>newch; if(newch=='n')    break; }  return 0; }

#include<bits/stdc++.h>
using namespace std;
#define MAX 1000 //Maximum size of stack 
class Stack{
   int top;// to store top of stack
   public:
   int elements[MAX]; //Integer array to store elements
   Stack(){ //class constructor for initialization
        top=-1;
   }
    bool push(int x) {
         if(top>=(MAX-1)) //Condition for top when stack because full
         {
              cout<<"Stack is full\n";
               return false;
          }
         else
          {
           ++top; //Increasing top value
            elements[top]=x; //storing it to element in to stack
            return true;
            }
}
int pop(){
     if(top<0)// Condition for top when stack is empty
     {
      cout<<"stack is empty\n";
      return INT_MIN;
      }
      else
      {
         int x=elements[top--];//poping out the element for stack by decreasing to element
         return x;
       }
}
int  display(){
if(top<0)//Condition for top when stack is empty
   {
      cout<<"Stack is empty\n";
      return INT_MIN;
    }
    else{
           for(int i=0;i<=top;i++)//running loop from start to top and printing elements
                     cout<<elements[i]<<"";
               cout<<endl;
               return 1;
           }
       }
};
int main()
{
cout<<"1.push\n 2. Pop\n 3. Display\n";
  char newch;
int ch;
Stack mystack;//Stack class object
while(1){//running loop till ‘n’ is not entered.
cout<<"Enter your choice:\n";
cin>>ch;
if(ch==1){
  int x;
  cout<<"Enter an integer element to push:\n";
  cin>>x; 
    mystack.push(x);
}
else if(ch==2){
  int x=mystack.pop();
  if(x!=INT_MIN)
     cout<<"Element"<<x<<"popped out\n";
}
else if(ch==3){
  mystack.display();
}
else
  cout<<"!!!Wrong Choice entered!!!\n";
cout<<"Do you want to continue:\n";
cin>>newch;
if(newch=='n')
   break;
} 
return 0;
}

Can you give me the output result screenshot for this code representing every operation and satisfying the problem statement.