By implementation, create the functions in public (C++)

Practice: Implement this hybrid approach / Implementation 5: // Stack is hybrid implementation of array and pointer. Elements are stacked into the array first from low-indexed locations to high-indexed locations. When all array locations is used up, extra elements are stored in a linked list. #include #de fine ARRAY SIZE 80 #de fine ERROR INT MIN template class Stack public: Stack () Stack ) bool Is_Empty ) const; bool Is Ful1() const void Push( XType; void Pop ) XType Top() const int Size) const protected: private: struct Stack Node Element; ????? Stack Node*Next; typedef Stack Node* Stack Ptr; XType Elements ARRAY SIZE1; Stack_Ptr TOS; int S Size