Create a Java class called Heap. It will contain a PriorityQueue as its lone attribute. This

PriorityQueue will simulate the heap. Your heap will keep its contents in sorted order. The

constructor to your Heap class will receive a single parameter, a String value. That String value

will be the name of a file containing words from two to six letters. Your constructor will build

the heap from those words, then use a sort method that you will write, based on the Heapsort.

Add the following methods to your Heap class:

$$ add$($String$)$ : adds the specified item and then sorts the heap

$$ remove$($String$)$: removes the specified item and resorts the heap

$$ exists$($String$)$ : returns a Boolean value stating whether that item is located on the heapIntention: To give the students practice working with Heaps

Description

Create a Java class called Heap. It will contain a PriorityQueue as its lone attribute. This

PriorityQueue will simulate the heap. Your heap will keep its contents in sorted order. The

constructor to your Heap class will receive a single parameter, a String value. That String value

will be the name of a file containing words from two to six letters. Your constructor will build

the heap from those words, then use a sort method that you will write, based on the Heapsort.

Add the following methods to your Heap class:

add$($String$)$ : adds the specified item and then sorts the heap

remove$($String$)$: removes the specified item and resorts the heap

exists$($String$)$ : returns a Boolean value stating whether that item is located on the heap

Hand in: Submit the Java code file $(.$java$)$ for your class.