3. Given the Stack class below: const int SIZE = 5; template class Stack ( template 10% friend ostreams operator &stk); // precondition: stack is not empty /l Postcondition: displays all objects on the stk in LIFO order; stk becomes empty when done public: Stack); // default constructor; set data member top to -1 indicating it is empty bool push(const T &obj); // precondition: stack is not full / postcondition: obj is pushed onto the stack; "stack pointer" incremented byI 18% returns true if successful; otherwise returns false 18% bool pop (T &objPopped); / precondition: stack is not empty /postcondition: Tobj on top of the stack is "logically" removed and value saved in objPopped: "stack pointer" decremented by 1: Returns true if successful; otherwise return false private: int top; points to the top of the stack T stkArray[SIZE]; bool empty(); 5% 5% bool full)