In a circular array based implementation if a queue what is the performance when the enqueue operation if you amortize the cost id resizing the array over all additions to the
a. o(1)
b. o(n)
c. o(logn)
d. o(n2)