Create a class called BinaryHeap

The BinaryHeap class will implement the following methods given K implements comparable and the Heap is backed by a resizing array that represents a min heap

void insert(K key) - Add this element to the heap

K deleteMin() - Remove the min element from the heap and return it

bool remove(K key) - remove an element from the heap and return true if successful or false if not.

Key[] heapSort() - Return an array that is a sorted representation of the data in the Heap (destructive)

void union(BinaryHeap b) - Create a union of the parameter heap with the underlying heap

*Use Java to implment code/program*Create a class called BinaryHeap

The BinaryHeap class will implement the following methods given K implements comparable and the Heap is backed by a resizing array that represents a min heap

void insert(K key) - Add this element to the heap

K deleteMin() - Remove the min element from the heap and return it

bool remove(K key) - remove an element from the heap and return true if successful or false if not.

Key[] heapSort() - Return an array that is a sorted representation of the data in the Heap (destructive)

void union(BinaryHeap b) - Create a union of the parameter heap with the underlying heap

*Use Java to implment code/program*