Queues ,operations and implementations of queues

#1

Operations on Linear Queue
Objective: To implement a program in C++ that performs various operations on Linear Queue, such as Enqueue, Dequeue, Front, Rear, IsEmpty, and Size.
Instructions for Students:
Implement the following operations on Linear Queue
Enqueue(Item) Operation:

  1. Check if the queue is full (if implementing with a fixed size).
  2. If not full, increment rear and add the element at rear.
    Dequeue() Operation:
  3. Check if the queue is empty.
  4. If not empty, check if front = rear then front = rear = -1 else front = front+1 and remove the element.
    Front() Operation:
  5. Check if the queue is empty.
  6. If not empty, return the element from the front of the queue.
    Rear() Operation:
  7. Check if the queue is empty.
  8. If not empty, return the element from the rear of the queue.
    IsEmpty() Operation :
  9. Check if front = rear = NULL.
  10. If Yes, return TRUE otherwise return FALSE.
    IsFull() Operation :
  11. Check if rear = MAX.
  12. If Yes, return TRUE otherwise return FALSE.
    Size() Operation :
  13. Check if the queue is empty
  14. If Yes, return -1 otherwise return rear-front+1.
    this is my class question so pls answer it as i could not write code write the code in simple words and explain it properly