I attached all relevant information, references, and information

Hi! I am completely lost and need assistance from a Java tutor professional. This specific task involves Priority Queue using Heap.

Here are the details and purpose of this:

Remember that a this queue can grow by doubling the array size (no need to move to the next prime number)

Include a toString() that returns the following format: [null, #, #, #, ...]

Only turn in your HeapPriorityQueue.java

Produce aHeapPriorityQueuejava class that uses an array to keep track of the heap data. Include the following interface:

PriorityQueueInterface.java

public interface PriorityQueueInterface> { boolean isEmpty(); boolean isFull(); void clear(); int size(); void add(T newEntry); T peek(); // returns null if empty T remove(); // throws NoSuchElementException if empty }