To complete this assignment, you must provide the implementation of each of the functions with the comment "Requires Implementation." There is no "main" application in this assignment, instead your code will be loaded against a set of test cases in Gradescope to test whether the library is operating as intended. Additionally, the TAs will inspect the code to be sure that you are actually implementing the queue via a circular array, rather than something like a linked list. Open "queue.h" to see the definition of the class, and provide your implementation in "queue.cpp." Here's "queue.h" and "queue.cpp" as provided if you can't find or open the files provided for whatever reason: /*queue.h*/ class queue private: int * arr; int begin; int end; int size; public: // Default constructor // Builds a queue containing room for 50 elements on the heap queue(); // Parametrized constructor 11 Builds a queue containing room for sz elements on the heap queue(int sz); // operator[] // Allows the user to extract a value in the queue // This value can be read and written, and is not removed from the queue // The index parameter specifies how far into the queue to go to find the element. index returns the first element of the queue A negative index, or an index greater than // the current length of the queue should throw an exception int& operator[](int index); // // // push(int) // Adds a new value to the queue, after the current last element. // The value parameter is used to create the new last element. // If the queue is full, throw an exception and do not modify the queue. void push(int value); // pop // // Removes the element at the current front of the queue, // making the second element the new first. // The value of the old first element should be returned. // If the queue is empty, throw an exception and do not modify the queue. int pop(); // empty 11 // Returns whether the queue is currently empty. // Returns true if the queue currently contains no elements. // Returns false if the queue currently contains at least one element. bool empty(); #include "queue.h" queue::queue // Requires implementation queue::queue(int sz) // Requires implementation int& queue::operator[](int index) // Requires implementation return index; void queue:: push(int value) // Requires implementation int queue::pop) // Requires implementation return ; bool queue:: empty() // Requires implementation return true; // done: // return