When implementing a Priority Queue using a normal Linked Cell List, the worst-case time complexity for the ENQ operation is O(N) because the new item may need to be inserted at the very end of the list, after comparing its priority against all existing N items.
If you consider implementing a Priority Queue (PrQUE) with a normal Linked Cell List (also known as a linked list), the worst-case time complexity of the "ENQ" (enqueue) operation would be O(N). Enqueue in a priority queue involves searching for the correct position to insert the new item based on its priority, which requires traversing the list in the case of a linked list. Given that the list contains N items, in the worst case, you may have to traverse the entire list, leading to a time complexity of O(N).
If you use a regular linked list to implement a priority queue, you should expect the enqueue operation's efficiency to diminish linearly with the number of elements already in the queue. Therefore, for a queue with N items, the worst case scenario for the enqueue operation is O(N).