Q$03.$ The order of time complexity of enqueue$-$ing an element into a priority queue $($with $n$ elements$)$:

a$.$ is independent of the particular implementation

b$.$ is $O(1)$ for any implementation using ordered arrays

c$.$ is always O$($nlogn$)$

d$.$ is always the same as the order of complexity of the dequeue operation

e$.$ none of the above