Thanks in advance for the help!

CS 202 - Computer Science II Project 9 Due date (FIXED): Saturday, 4/25/2017, 11:59 pm Objectives: The main objectives of this project are to test your ability to create and use queue- based dynamic data structures. A review of your knowledge to manipulate dynamic memory, classes, pointers and iostream to all extents, is also included. You may from now on freely use square bracket-indexing, pointers, references, all operators, the library, and the stdiistring type as yo u deem proper Des For this project you will create a Queue class, both an Array-based and a Node-based variant. A Queue is a First In First Out (FIFO) data structure. A Queue exclsively inserts data at the back (push) and removes data from the front (pop). The Queue's front data member points to the first inserted element (the front one), and the back data member points to the last (the rear one). cription: Array-based Queue: The following ArrayQueue.h file extract is used to explain the required specifications for the class (it implements a Queue handling DataT'ype objects): const size t ARRAY MAX 1000 class ArrayQueue friend std::ostream &operator