Implement the poll() method in PriorityQueue.java file. This method will return null if the tree is.

Implement the poll() method in PriorityQueue.java file. This method will return null if the tree is.
Implement the poll() method in PriorityQueue.java file. This method will return null if the tree is empty. Otherwise, it will remove the root from the Heap and return the value from the root. This is what I have so far dont know what I am doing wrong public E poll() {     if(heap.isEmpty())         return null;     else         heap.removeRoot();     return heap.getRoot().getElement(); } Implement the clear() method in PriorityQueue.java file. This method will not throw any errors on an empty Heap. It will remove all nodes from the Heap so that is is empty. public void clear() {       //Task 4: Your code here…     //No errors on an empty heap     //remove all nodes from heap }   May 13 2022 07:28 PM