Instructions: Please, submit your programs as one .cpp 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++ standard features. Using your code, I should be able to create instances of your classes/structures and call your methods. In your comments, you need to explain why you implemented the Abstract Data Types (ADT) as C++ classes or as C++ structures (5points). For extra 5 points you can claim that your code is thread-safe (meaning I can use your structures in parallel processing).

1. Implement ADT Linked List in C++ (25 points). You should implement at least Insert, Delete, and Find interfaces. For extra 5 points, implement generic structure that accept any type of data stored at list nodes.

2. Implement ADT Stack in C++ (35 points). You should implement at least Push, Pop, Peek (see what is on top without removing it), and IsEmpty (returns true if stack is empty) interfaces. For extra 10 points, implement generic structure that accept any type of data stored in the stack.

3. Implement ADT Queue in C++ (35 points). You should implement at least Add, Remove, Peek, and IsEmpty interfaces. For extra 10 points, implement generic structure that accept any type of data stored in the queue.

Please, NOTE: If your code cannot do, at least, create, add, and delete functionality, no points will be awarded. Your code can fail sometime in non-standard situations, also points will be taken off in such cases. Therefore, validate your parameters, throw exception and let your code fail gracefully. If you get a not satisfactory grade, you are encouraged to resubmit your code for reevaluation. Final score will be averaged.