Question 3 Not yet answered A queue is implemented using a circular array with dynamic expansion such that ENQUEUE and DEQUEUE operations are performed efficiently(suppose that the size of the array is more enough to store data). Which one of the following statements is CORRECT (n refers to the number of items in the queue)? Marked out of 2.00 Flag question Select one: O a Both operations can be performed in 0(1) time O b. At most one operation can be performed in 0(1) time but the worst case time for the other operation will be O(n) c. The worst case time complexity for both operations will be on) d. Worst case time complexity for both operations will be (logn)