Implementation of enqueue(), dequeue() and display() operations in circular queue.Implementation of enqueue(), dequeue() and display() operations in circular queue.Write a class called CircularQueue and perform all the operations given belowvoid enqueue()void dequeue()void display()Note: Also complete utility functions isEmpty() and isFull()to check queue is empty/full or not.

Implement a circular queue using an array. Provide the enqueue and dequeue operations. give the answer for 5 marks

What happens when you try to enqueue an element into a full Circular Queue?a)The oldest element in the queue is automatically dequeued.b)The new element overwrites the oldest element in the queue.c)An error is thrown, and the enqueue operation fails.d)The new element is placed at the front of the queue.

Q2(a) Given a circular queue with capacity of 9 elements. Show what the contents of the array will be after the specified sequence of enqueue and dequeue operations and show that where the front and rear indices will point. [1.5+1.5 Marks] (a.1) Let us assume that it is array-based, then after performing following operation show the intermediate and final items present in the array? int i; for (i = 1; i <= 9; ++i) enqueue (i); for (i = 1; i <= 5; ++i) { enqueue (dequeue()); dequeue(); } (a.2) Do not start from scratch to build the queue here; continue the following operations on the queue you have created in part (a.1) above. enqueue (10); enqueue (11); dequeue(); dequeue(); enqueue (12); Show the contents of array after each step?

What is circular Queue? Write a C code to insert anelement in circular Queue and condition for full andemptiness of circular Queue

Suppose that Q is a queue implemented with a circular array A,  initially empty (with size/capacity = 0). You run the following operations in the order given:1. Q.enqueue(7) 2. Q.enqueue(42) 3. Q.enqueue(3) 4. Q.dequeue()5. Q.enqueue(10)6. Q.first()7. Q.enqueue(5)8. Q.enqueue(30)9. Q.enqueue(15)10. Q.dequeue()11. Q.dequeue()12. Q.dequeue()13. Q.dequeue()14. Q.dequeue()Assuming that insertion and deletion in dynamic arrays use the resizing strategy we have seen during the lectures, describe the entries of the array A after performing the above operations, separating each entry by a comma and no space. If an entry is empty, write "None" (case-sensitive). For example, if the array was [1, 2, None, None], then write "1,2,None,None", omitting the double quotes.