write a java code with the same idea of binary heapsorting except in the heap where each node has three children

a node > 1, will have its 3 children at 3 1, 3, and 3 + 1. The parent is at FLOOR ( + 1)/3

The node = 1 is the root of the heap, so it does not have a parent, but its children are at positions 3 1, 3, and 3 + 1as well.

Implement the algorithms: MaxHeap , HeapSort.

example

Enter unsorted array: 1 8 6 5 3 7 4

Max Heap 8 7 6 5 3 1 4

Heapsort 1 3 4 5 6 7 8