Instructions: Please submit your programs as one.cpp/c file with any read.me instructions inside and commented out using /... % The file should include your name at the top of the file. You are not to use any external libraries and should use only C++basic features. Using your code. I should be able to create instances of your classes/structures and call your methods. 1. Implement ADT Linked List in C++ (2 points) You should name your type/class/structure as LinkedList. It should implement the following functions: int Add int data) - adds new item to the end of the list and returns the size of the list: int Delete() - deletes an item from the end of the list and returns data of the item: bool IsEmpty()-checks if the list contains no elements: int Length - returns number of items in the list: 2. Implement ADT Stack in C++ (2 points). You should name your type/class/structure as Stack. It should implement the following functions: int Push(int data) pushes data on the stack and returns the size of the stack: int Pop() - removes data from the stack; int Peek 0 - see what data is on top without removing it: bool IsEmpty() - checks if the stack has no data int Sizel-returns number of items in the stack: 3. Implement ADT Queue in C++ (2 points) You should name your type/class/structure as Queue. It should implement the following functions: int Enqueueint data) - add data item to the queue; int Dequeue() - removes item from the queue: bool IsEmpty()-checks if the queue has no data. int Sizel-returns number of items in the queue: Extra points: Implement generic type structures that except any type of data (2 point)