Maintain the waitList as a max priority queue. Each student entering the queue
is given a priority value ranging from 1 to maxLimit where maxLimit is the max-
imum number of students allowed in the course. Implement this priority queue
using a maxHeap. Define operations insert(Q, x) to insert an element x to the pri-
ority queue Q, extract Max(Q) to remove and return the element with the highest
priority value from Q, increaseKey(Q, x, k) to increase the priority value of ele-
ment x in Q to the new value k (new value is assumed to be at least as large as
the current priority value of x)