c++ program help

ueue queue: int -front: int -rear: int -max: int MyQueue(s: int) MyQueue( enqueueli: int) : int dequeue):int topit: int&): int 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 of 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. enqueue- adds it's argument to the end of the queue. Returns 0 if successful, -1 otherwise. Will fail if the queue is full. dequeue- removes the value at the front of the queue. Returns 0 if successful,-1 otherwise. Will fail if the queue is empty top-assigns the front value to it's reference parameter. Returns 0 if successful,-1 otherwise. Will fail if the queue is empty. e Place your entire class in it's own header file named MyQueue.h. Remember to define your methods. Remember to include preprocessor gaurds. Hints Write your own program to test your queue. Test it by enqueueing a bunch of numbers, and then dequeue them to make sure they come out in the right order On the final, you will be responsible for static and dynamic stacks and static and dynamic queues