make sure option $7$ print out the same

Part $2(80$ points$)$: Implement Priority Queue using Heap structure. Download and complete the implementation of class PQ$\_$Heap.java, provided with this assignment. The only data member we need for this class is a heap object created from class Heap.java in part $1$ above. Hint: Create the heap object as private data member in class$/$file PQ$\_$Heap.java; Then use the methods in class Heap.java to implement the priority queue methods outlined in class$/$file PQ$\_$Heap.java by applying the heap methods on the heap object. In other words, implement class PQ$\_$Heap using methods in class Heap.java. It is recommended that you implement class PQ$\_$Heap.java as a generic class, similar to class Heap.java. In addition, to implement all priority queue methods outlined in class PQ$\_$Heap.java, you may need to include additional methods to the generic class Heap.java. Next, create a new test file named TestPQH.java to test class PQ$\_$Heap.java. Use the following menu options as shown below $($No menu, no points!$).$ Force the user to start with option $0$ to select the data type of the priority queue content. Then allow the user to exercise other menu options on the selected queue type. $0.$ Enter Queue Type $($integer or string$)1.$ Enqueue Element $2.$ Dequeue Element $3.$ Check is Full $4.$ Check is$\_$Empty $5.$ Print PQueue Size $6.$ Display Front Element $7.$ Print PQueue Elements $8.$ Exit program Enter option number: Note: The author uses ArrayList to implement the heap, so we cannot have a static size for the ArrayList unless to impose a certain capacity for the heap. In order to implement options $3$ and $4$ above, we need to set the heap capacity to a certain size. For this assignment, let's all added variable int CAPACITY $=100$; in class Heap.java for this purpose. Also, in class Heap.java, method list.size $()$ gives you the current size of the heap. Always re$-$display the menu after an option $($other than option $8)$ is fully exercised with blank lines before and after the menu. For option $7,$ print the PQ content as shown below. Notice that value $99$ below is the parent node for values $66($left child$)$ and $44($right child$)$; value $66$ is the parent node for values $33($left child$)$ and $22($right child$)$; Nodes $44,33,$ and $22$ have no child nodes on the heap

For option $7,$ print the $PQ$ content as shown below. Notice that value $99$ below is the parent node for

values $66($left child$)$ and $44($right child$)$; value $66$ is the parent node for values $33($left child$)$ and $22($right

child$)$; Nodes $44,33,$ and $22$ have no child nodes on the heap.

PQ$\_$HEAP.JAVA

$//$ Generic code for class priority$\_$queue$\_$heap for Assignment $5$

public class PQ$\_$heap

$\{$

$//$ Constructor method

PQ$\_$heap$()\{\}$;

$//$ Return true if priority queue is empty; otherwise return false

public boolean is$\_$empty$()\{$

$\}$;

$//$ Return true if priority queue is full; otherwise return false

public boolean is$\_$full$()\{\}$;

$//$ Return $($don$\text{'}$t remove$)$ the front element from the priority queue

$//$ Precondition: priority queue is not empty.

public int front$()\{\}$;

$//$ return number of elements in the queue

public int size$()\{\}$;

$//$ Remove the largest value from this priority queue and return it$.$

$//$ Precondition: priority queue is not empty.

public int dequeue$()\{\}$;

$//$ Inserts the 'value' into the priority queue.

$//$ Precondition: priority queue is not full

public void enqueue$($int value$)\{\}$;

$\}$

HEAP.JAVA

$//$ Class Heap.java

$//$ Textbook $-$ Listing $23\mathrm{.}9,$ Page $878$

public class Heap$>\{$

private java.util.ArrayList list $=$ new java.util.ArrayList$()$;

$/**$ Create a default heap $*/$

public Heap$()\{$

$\}$

$/**$ Create a heap from an array of objects $*/$

public Heap$($E$[]$ objects$)\{$

for $($int i $=0$; i $$ objects.length; i$++)$

add$($objects$[$i$])$;

$\}$

$/**$ Add a new object into the heap $*/$

public void add$($E newObject$)\{$

list.add$($newObject$)$; $//$ Append to the heap

int currentIndex $=$ list.size$()-1$; $//$ The index of the last node

while $($currentIndex $>0)\{$

int parentIndex $=($currentIndex $-1)/2$;

$//$ Swap if the current object is greater than its parent

if $($list$.$get$($currentIndex$).$compareTo$($

list.get$($parentIndex$))>0)\{$

E temp $=$ list.get$($currentIndex$)$;

list.set$($currentIndex$,$ list.get$($parentIndex$))$;

list.set$($parentIndex$,$ temp$)$;

$\}$

else

break; $//$ the tree is a heap now

currentIndex $=$ parentIndex;

$\}$e

$\}$

$/**$ Remove the root from the heap $*/$

public E remove$()\{$

if $($list$.$size$()==0)$ return null;

E removedObject $=$ list.get$(0)$;

list.set$(0,$ list.get$($list$.$size$()-1))$;

list.remove$($list$.$size$()-1)$;

int currentIndex $=0$;

while $($currentIndex $$ list.size$())\{$

int leftChildIndex $=2*$ currentIndex $+1$;

int rightChildIndex $=2*$ currentIndex $+2$;

$//$ Find the maximum between two children

if $($leftChildIndex $>=$ list.size$())$ break; $//$ The tree is a heap

int maxIndex $=$ leftChildIndex;

if $($rightChildIndex $$ list.size$())\{$

if $($list$.$get$($maxIndex$).$compareTo$($

list.get$($rightChildIndex$))<mtext\; id="EditorElement\_2729685"></mtext><mn\; id="EditorElement\_2729686">0</mn><mi\; id="EditorElement\_2729687">)</mi><mtext\; id="EditorElement\_2729688"></mtext><mi\; id="EditorElement\_2729689">\{</mi>$

maxIndex $=$ rightChildIndex;

$\}$