A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)? [GATE CSE 2016]Question 4Answera.Both operations can be performed in O(1) timeb.Worst case time complexity for both operations will be Ω(log n)c.The worst-case time complexity for both operations will be Ωd.At most one operation can be performed on O(1) time but the worst-case time for the other operation will be Ω

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

In an ideal implementations of a queue, all operations are ______________________ . A. O(1) B. O(n) C. O(n2) D. it depends on the operation E. O(n log n)

Select the correct answerThe stack using queue(with only enqueue and dequeue operations), how many queues will we need for implementing?Options3412

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?