What is the performance of the following operations for a Priority Queue.

A Priority Queue is an Abstract Data Type like a Queue, because it has the same operations

(insert, delete, and isEmpty),

BUT each item has a 'priority' associated with it, and deletion returns the item with highest priority.

Imagine it's a queue, and ask yourself how to delete the item with the highest priority instead

of the item that's been in the queue the longest.You only have to think about the algorithm.

To simplify things further, just assume it's a collection of numbers.When you want a deletion,

just remove the biggest number.

Give the performance (O(X)) of each these operations

insertion (insert a given item)

and

deletion (delete the largest item)

and explain why by describing enough of the algorithm to justify your choice of performance

category (e.g., It takes O(N) time because... the algorithm does such and such...).

(a) for an array, with the items in unsorted order

(b) for an array, with the items in sorted order (by priority)