Multiple answers allowed, these are my guesses

Given a heap of size n , which of the followings are correct? The upper bound of Build Heap() function is 0 (n) BuildHeap() uses a top-down manner The lower bound of heapsort in the worst case is 12 (n log n) Heapify() uses a bottom-up manner