Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q). The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is ______________.*2 points4568

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.

In a circular queue of size 7 if front index=5 and rear index =3 then ___ enqueue operations has been performed.

Consider a queue implemented as an array. The queue has a maximum capacity of 5. Initially, the queue is empty. After performing the following operations: enqueue(1), enqueue(2), enqueue(3), dequeue(), enqueue(4), enqueue(5), what will be the front and rear pointers respectively?front = 0, rear = 4front = 1, rear = 4front = 1, rear = 0front = 0, rear = 3

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?

In a Circular Queue of size 8, if you enqueue 6 elements and then dequeue 4 elements, how many empty slots are there in the queue?a)1b)0c)3d)2