A heap can also be ternary: each node has three children. In general, it's possible to implement a k-ary heap for any positive integer k.

Implement a version of heapsort based on a complete ternary heap. Use the code from the textbook as a model (seen throughout 2.4) but change it so each heap node has 3 children instead of 2. Test your implementation using 100 randomly ordered distinct keys.

I WANT THIS CODE IN JAVA PROGRAMMING LANGUAGE USING IntelliJ.

PLEASE I WANT THIS ANSWER AS SOON AS POSSIBLE.