In a linked chain implementation of a queue with a head and tail reference, the performance of the enqueue operation is

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

There are no hints for this question