Need to write the code of binary heap that takes nlogn and an other that takes n.

inside the file heap.( java, py, or c whichever language you want to use) Implement these functions:

Psuedo for slow heap version 1:

Psuedo for fast one(uses bubble down):

(10] In this programming question, you w implement the two versions of the BUILD-MAX-HEAP operation that we learned in lecture, which takes an unordered list as the input and manipulates it into a list that represents a binary max-heap. Version 1 builds the heap by repeatedly heap-inserting all elements in the list into an initially-empty heap, which takes O(nlogn) time; Version 2 is the beautiful and efficient O(n) algorithm that calls BUBBLE-DOWN on about half of the elements in the list. You will also implement an IS-HEAP function which is useful for checking whether the heap that you built is a valid one. Below are the detailed specifications