If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?
$O(n), O(1)$
$O(1), O(1)$
$O(1), O(n)$
$O(n), \theta(1)$