1 Implement the general Priority Queue ADT using the min-heap implemented as an array. Instead of having the number of priority levels as an argument of the constructor, specify the maximum capacity...

1 Implement the general Priority Queue ADT using the min-heap implemented as an array. Instead of having the number of priority levels as an argument

of the constructor, specify the maximum capacity of the queue. In addition, de_ne the isFull() method that returns True when the queue is full and False otherwise.

2 Implement the general Priority Queue ADT using the min-heap implemented as a vector. Instead of having the number of priority levels as an argument of the constructor, specify the maximum capacity of the queue.