the question will be given in the first picture , and the code ( the source ) will be given in the last 4 pictures.

3 Given the codes for "stack_03.cpp" and do the following tasks. Complete the code for emptyStack() function, which will remove all items in the stack using the pop() function. The output must be exactly as below: Push operation success! item: a Push operation success! iten: e Push operation success! item: s Push operation success! item: S Push operation success! iten: e Push operation success! item: r Push operation success! iten: t Push operation success! item: s Enpty the content of the stack with the following order : stressed Stack is empty MODULE & STACK 77 stack_01.cpp include Jinclude using namespace std; 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 #define MAXSTACK 10 class Stack private: int top: char data (MAXSTACK) ; public: Stack(); bool is Full(); bool isEmpty(); void push (char); char pop(); // return the popped item ); // and Stack class declaration Stack::Stack() { top = -1; } bool Stack::isPull() return (top- (MAXSTACK - 1)); } bool Stack::isEmpty() return (top = (-1)); } void Stack::push(char item) if (!isFull()) top++; data[top] = item; cout else { cout #include using namespace std; #define MAXSTACK 10 class Stack private: int top: char data (MAXSTACK) ; public: Stack() top = -1; } bool isPull(); bool isEmpty(); void push(char); void printLIFO(); void printPIPO(); ) 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 1 bool stack::isPull() return (top - (MAXSTACK - 1)); ) bool Stack::isimpty() return (top - (-1)); ) void Stack::push (char item) if (!isPull()) top++; data[top] - item; cout ) 44 ) 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 int main() Stack stack stack.push('a'); stack push('b'); stack.push('a'); cout include using namespace std; #define MAXSTACK 10 class Stack private: int top: char data [MAXSTACK]; public: Stack() { top = -1;) bool is Pull(); bool isEmpty(); void push (char): void pop(); void emptyStack(); } 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 bool Stack::isPull() return (top- (MAXSTACK - 1)); 1 bool Stack::isEmpty() 1 return (top == (-1)); 1 void stack::push(char item) if (!isFull()) top++; data[top] - item; cout