Answer the following about HeapSort related algorithms (max heap) How many times Heapify will be called in total (including recursive calls) if we call BuildHeap on the following array: A = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]. Write the content of the array after Build Heap call. Draw the heap (in the binary tree form) after BuildHeap call.