In Java please.

Create a HeapPriorityQueue interface with the following abstract methods. isEmpty, isFull, enqueue, dequeue, reheapifyUpward, reheapifyDownward, reposition b) Create the HeapPriorityQueue class. Have Heap Array hold maxSize of 250 entries. Also, include the methods: default constructor, toString. c) Create HeapOverflowException and HeapUnderflowException classes d) Create a HeapDemo class that creates a HeapPriorityQueue object and insert the values 1 -10 into the heap Print out the heap and remove two values from the heap Print the resulting heap Try and show the resulting tree with the nodes on their appropriate levels along with their branches.

2. Start with an empty heap, and enter ten items with priorities 1 through 10. Draw the resulting heap. Now remove three entries from the heap that you created in the above exercise. Draw the resulting heap