Solution:Analyze the statements :
(A) The MAX-HEAPIFY procedure, which runs in O(lgn) time, is the key to maintaining the max-heap property. So, the statement (A) is correct.
(B) The BUILD- MAX-HEAP procedure, which runs in linear time, produces a max-heap from an unordered input array. So, the statement (B) is incorrect.
(C) The MAX-HEAP-INSERT, HEAP-EXTRACTMAX, HEAP-INCREASE - KEY, and HEAPMAXIMUM procedures, which run in O(lgn) time, allow the heap data structure to be used as a priority queue. So, the statement (C) is correct and statement
(D) is incorrect.