Please help with exercise 1 of this lab (queue.h, queue.cpp,exercise1.cpp) I have Linked List files already if needed

Overview In this lab, we will explore a new useful data structure: Queues. Queues are usually referred to as a FIFO (First In First Out) structure, where the first element inserted into the data structure is the first one to be removed from it. Queues can be implemented with any type of container (e.g. arrays, linked lists, etc.). In this lab, you will implement the Queues with your implementation of the Linked Lists in Lab # 8. In fact, you can think of Queues as Linked Lists, with the FIFO constraints: you will implement them using inheritance, by inheriting from a Linked List class