Define heap. Write down the heap sort algorithms or program for the heap sort. (heap definition→ why array represented as heap→ write all steps of heap sort algorithms such as parent, left, right, max heapify, build max heap→ finally heap sort)

Define a heap. Represent the heap as an array and perform the following operations: · Insert 25. · Delete 86 and 11 from the heap. . Sort the elements in descending order using Heap Sort.