How to implement heapsort bottom-up code program in java given these instructions specific instructions bolded in red?

Thank you

A bottom-up heap sort does not take the next value, place it at the top of the heap and sift it down, it finds where that value goes and pushes all its new ancestors up until the next value to be chosen is at the top of the heap. 25 25 14 15 14 15 12911 7 129117 15 14 129 Consider the above heap. 25 will be placed in the sorted list, and 7 is the next value we will consider (green). A bottom up heap would know that 11(red) is the leaf of the 'prime path'2, so 7 is checked against it, and then each parent in turn until a bigger value is found or it makes it to the root (which would only happens in one special case). As it turns out, hint: it is not uncommon for there to be very few comparisons