In Java language

--- so far what I wrote ----

public void removeDuplicates (HeapIntPriorityQueue pq) {

Stack aux = new Stack();

while (!pq.isEmpty()) {

int n = pq.remove();

aux.push(n);

Write a method called removeDuplicates that accepts a PriorityQueue of integers as a parameter and modifies the queue's state so that any element that is equal to another element in the queue is removed. For example, if the queue stores 17, 7,8,8, 8, 10, 45, 45], your method should modity the queue to store 17, 8, 10, 45]. You may use one stack or queue as auxiliary storage