52. The priority queue is a data structure used to maintain the elements x in the S set, and
each element x has an associated value called a key. The MAX-PRIORITY QUEUE
supports some operations. Which of the following does NOT support?
(A) INSERT(S, x) (B) INCREASE-KEY(S, x, k)
(C) EXTRACT-MAX(S) (D) MINIMUM(S)