Can I have help doing this program. I understand the concept of Queues but it is confusing to put the concept on the code. Like if I EnQueue 1, it goes in the 0 slot, EnQueue 2 it goes in the 1 slot, EnQueue 3 goes into the 2 slot, DeQueue takes the 1 out of slot 0 etc etc. However, I'm lost on this specific assignment. Can someone guide me through their program?

__________________________________________

C++ Create a class/struct. Members: MaxSize const = 10 Define an array that holds 10 items. Count - indicates how many items are on the queue. Front - where the front of the queue is in the array. Back - Where the end of the queue is in the array.

Methods: En-queue - Accepts a number and adds to the end of the queue. - If the queue is full emit an error indicating full. De-queue - Returns a number from the front of the queue. - If the queueis empty, emit an error indicating the queueis empty. IsEmpty - Returns a boolean indicating if the queue is empty.

*Note that the front and back can wrap around the end of the array over time. I.e. when the "back" of the queue gets to the last valid array index, the next insert will be into array index 0.