Key Points Code must be object oriented Code must be thoroughly commented The project shall use the queue data structure learned in the course. Do not use the queue library. Scenario A supermarket has...

Code:
// required header files
#include
#include
using namespace std;
// required class
class Cashier {
private:
// required private variables
int first, last, size, count;
int *storage;
public:
// create a constructor
Cashier(int n) {
// initialize the variables
first = 0;
last = -1;
count = 0;
size = n;
// dynamic storage
storage = new int[size];
}
//checking for queue, if full
bool is_full() {
// return count
return (count >= size);
}
//check if queue is empty.
bool is_empty() {
return (count == 0);
}
// adding the elements in queue
int enqueue(int el) {
// check if it is not full
if (!is_full()) {
// find the last
last = (last + 1) % size;
// increment the counter
count++;
storage[last] = el;
// return whn element is added
return 1;
} else {
// return 0 when not added
return 0;
}
}
// dequeue the elements
int dequeue() {
if (!is_empty()) {
//int tmp = storage[first];
// find the first
first = (first + 1) % size;
//...