One of the fastest known sorting algorithms is Heapsort. The key phase of this algorithm reorders an array a of integers so that two properties hold for all indices k: a [k] > = a [2k + 1] and a [k] > = a [2k + 2] This phase of Heapsort is implemented by the method heapify.//heapify (a) turns a into a heap in-place public void heapify (int [] a) { for (int root = a. length/2 - 1;root > = 0;root--) { boolean done = false; while (2 * root + 1