This course is an Advanced Data Structures course, meaning we anticipate that you already have prior experience implementing Data Structures and Abstract Data Types $($ADTs$).$ One such Data Structure with which we expect you to be familiar is the Linked List, and one such ADT with which we expect you to be familiar is the Queue.

Task: Edit Queue.cpp

In this part of the assignment, we have provided a file called Queue.cpp that contains the initial steps towards writing a Queue ADT implementation using a Singly$-$Linked List. Function headers $($with usage details$)$ are included in Queue.h$,$ and you need to fill in the constructor, destructor, and all functions. Be sure to only modify Queue.cpp: do not modify Queue.h$.$ You will also not be able to use any of the C$++$ STL containers.