Lab on Stacks and Queuea using Linked list. I'm alittle confused on how to use linked list with a stack and queue class. Please help with detailed cpp or and header file.

2017 Fall CIS200-Lab 8 Stack and Queue Release date: November 8, 2017 Due Date: November 15, 2017 Linked list is a perfect data structure for the implementation of stack and queue. Especially for the queue, it avoids the headaches of wrapping-around manipulation for a queue implemented by an array. In this project, you are requested to implement both stack and queue by using a linked list (not an array). NOTE: NOTALL TEST CASES ARE COVERED IN THE CODE SEGMENTS TEST CASES YOU IDENTIFY AND TEST. Highlight in the test plan AND the input and output files where the defect is ABOVE PART OF YOUR GRADE IS DETERMINED BY WHAT ADDITIONAL iabstxt eccurring Output Ale name: iab,xt 1- Develop and test individually meta templated ass Stack as defined by the following skeleton: template private NodeType &x); I copy constructor: implicitly called for a Il deep copy void MakeEmpty0 Il Stack is made empty; you should deallocate all the bool IsEmpty ); bool IsFull); int length) void Print(): /l the nodes of the linked list /l test if the stack is empty // test if the stack is full; assume MAXITEM-5 // return the number of elements in the stack // print the value of all elements in the stack in the ll sequence from the top to bottonm void Push(ItemType x); I/insert x onto the stack void Pop(ltemType &x); II delete the top element from the stack // Precondition: the stack is not empty // Destructor: memory for nodes deallocated -Stack0