2. Implement a MaxThreeHeap. It should be an implementation of the heap data structure we've discussed in
class. Unlike the implementation discussed in lecture, it should be a three-heap (not a two-heap). In other words,
each node should have three children, not two. In addition, the maximum value has priority, unlike the minHeaps
discussed in class. All operations should have the efficiencies we've discussed in class. No plagiarized code
allowed in this question. Submit your Java file. Include test functions for each operation. *Int type is ok,
Implement Insert and DeleteMax*
