2017 Fall CIS200-Lab S Stack and Queue Relcase date: November 8, 2017 Due Date: November 15, 2017 ack Linked list is a for the queue, it avoids the headaches of wrappinto tructure for the implementation of stack and queue. Especially for a queue this project, you are requested to implement both stack and mplemented by an aray, In this project, you are r queue by using a linked list (sot an aray) NOTE: ABOVE PART OF YO ERED TEST CASES YRDE IS DETERMINED BY WIAT ADDITIONAI YOU IDENTIFY AND TEST lighlight ia the test plan AND the the input and output iles where the defeet is Outpat Ale nam: iabs.th Seprote transhols, cpp ile, test and test individually template class ItemType> class Stack private: NodeTypesdtem Type topPtr: points to a singly-linked list public: Stack): / default constructor: Stack is created and empty Stack ll copy constructor: implicitly called for a l deep copy (const StackcItemType>&x); void MakeEmpty: / Stack is made empty: you should deallocate all the bool IsEmpty); bool IsFullO: int length void PrintO; the nodes of the linked list / test if the stack is empty l/ test if the stack is full; assume MAXITEM-5 /l return the number of elements in the stack //print the value of all elements in the stack in the Il sequence from the top to bottom insert x onto the stack void Push(ItemType x); void Pop(ItemType&x); -Stack0: ll delete the top element from the stack Wl Precondition: the stack is not empty / Destructor: memory for nodes deallocated 2017 Fall CIS200-Lab S Stack and Queue Relcase date: November 8, 2017 Due Date: November 15, 2017 ack Linked list is a for the queue, it avoids the headaches of wrappinto tructure for the implementation of stack and queue. Especially for a queue this project, you are requested to implement both stack and mplemented by an aray, In this project, you are r queue by using a linked list (sot an aray) NOTE: ABOVE PART OF YO ERED TEST CASES YRDE IS DETERMINED BY WIAT ADDITIONAI YOU IDENTIFY AND TEST lighlight ia the test plan AND the the input and output iles where the defeet is Outpat Ale nam: iabs.th Seprote transhols, cpp ile, test and test individually template class ItemType> class Stack private: NodeTypesdtem Type topPtr: points to a singly-linked list public: Stack): / default constructor: Stack is created and empty Stack ll copy constructor: implicitly called for a l deep copy (const StackcItemType>&x); void MakeEmpty: / Stack is made empty: you should deallocate all the bool IsEmpty); bool IsFullO: int length void PrintO; the nodes of the linked list / test if the stack is empty l/ test if the stack is full; assume MAXITEM-5 /l return the number of elements in the stack //print the value of all elements in the stack in the Il sequence from the top to bottom insert x onto the stack void Push(ItemType x); void Pop(ItemType&x); -Stack0: ll delete the top element from the stack Wl Precondition: the stack is not empty / Destructor: memory for nodes deallocated