A priority queue is implemented as a sequential array-based list. The highest-priority element is in the first array position, the second-highest priority element is in the second array position, and so on.
a. Write the declarations needed for this implementation.
b. Write the e nque ue operation, using this implementation.
c. Write the de que ue operation, using this implementation.