### Question:
HeapPriorityQueue extends AbstractPriorityQueue<K,V> { @Override public Entry<K,V> min() ; HeapPriorityQueue();  HeapPriorityQueue(Comparator<K> comp); @Override int size(); @Override Entry<K,V> min(); @Override Entry<K,V> insert(K key, V value); @Override Entry<K,V> removeMin();  }### Answer:
@Test void testMin() { Integer[] arr = new Integer[] {35,26,15,24,33,4,12,1,23,21,2,5}; HeapPriorityQueue<Integer, String> pq = new HeapPriorityQueue<>(); for(Integer i : arr) pq.insert(i, Integer.toString(i)); assertEquals(1, pq.min().getKey()); }