The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
answer = option A
Just keep inserting elements making sure resulting Tree is nearly Complete.(Heap Property) .
While inserting any node, if you find that Value of New Node $>$ Value of it's parent, bubble it up to keep Max heap property