In a circular array-based implementation of a queue, with one unused element what is the performance of the dequeue operation?

O(1)
  • O(logn)
  • O(n)
  • O(n^2)

There are no hints for this question