A priority queue is implemented as a sequential array-based list.

The highest-priority item is in the first array position, the secondhighest-

priority item is in the second array position, and so on. 1. Write the declarations in the private part of the priority queue class definition needed for this implementation. 2. Write the Enqueue operation using this implementation. 3. Write the Dequeue operation using this implementation. 4. Compare the Enqueue and Dequeue operations to those for the heap implementation, in terms of Big-O notation.

Under what conditions would this implementation be better or worse than the heap implementation?