array-based implementation question

[intelli]

Array-based implem of a queue that stores the front of the queue at index 0 in the array, the dequeue operation is
a impossible to implement
b has several special cases
c O(n)
dO(n2)
e none of the above

i dont understand this question i dont know what the ans is where do i look for ans for this question.

[OrangeDog]

It's a multiple choice question asking about the dequeue operation in an array-based queue. The big-O notation refers to time complexity. You look for the answer by paying attention in class, reading your course material and/or asking your tutor for help.