Use the following UML diagram and class description to create your own static queue that stores integers. Accessors should be marked cons queue: int front: int rear: int max: in MyQueuels: int: MyQueue0 enqueue: int):int dequeueo: int topft intB):int Class Attributes: queue- a pointer that stores the memory address for a dynamically allocated array of integers. front -stores the index of the element that stores the value at the front af the queue. rear-stores the index of the element where the next value will be added to the queue. max-stores the the size of the array. constructor- stores it's argument in max, dynamically allocates an array of max elements, and initializes front and rear to 0. destructor- frees all memory used by the object enqueue- adds it's argument to the end of the queue. Returns O if successful, -1 otherwise. Will fail if the queue is full. dequeue- removes the value at the front of the queue. Returns O if successful, -1 otherwise. Will fail if the queue is empty. top-assigns the front value to it's reference parameter. Returns O i successful,-1 otherwise. Will fail if the queue is empty. Submission Details: .Place your entire class in it's own header file named MyQueue.h. Remember to define your methods. Remember to include preprocessor gaurds HintsWrite your own program to test your queue. Test it by enqueueinga n dequeue them to make sure they come out in