Implement a heap using an array. For binary heap, a node > 1, will have its children at positions 2 and 2 + 1, while the parent node is at FLOOR(/2 ) The node = 1 is the root of the heap, so it does not have a parent, but its children are at positions 2 and 2 + 1 as well.

Implement the algorithms: MaxHeap , HeapSort.

example :

Enter unsorted array: 2 9 7 6 5 8

output

Binary Max Heap 9 6 8 2 5 7

Binary Heapsort 2 5 6 7 8 9