### Question:
HMapII implements MapII, Cloneable, Serializable { public MapII.Entry[] getEntriesSortedByValue() { if (this.size() == 0) return null; MapII.Entry[] entries = new Entry[this.size()]; int i = 0; Entry next = null; int index = 0; while (index < table.length && (next = table[index++]) == null) ; while (next != null) { Entry e = next; next = e.next; if ((next = e.next) == null) { while (index < table.length && (next = table[index++]) == null) ; } entries[i++] = e; } Arrays.sort(entries, new Comparator<MapII.Entry>() { public int compare(MapII.Entry e1, MapII.Entry e2) { if (e1.getValue() > e2.getValue()) { return -1; } else if (e1.getValue() < e2.getValue()) { return 1; } if (e1.getKey() == e2.getKey()) return 0; return e1.getKey() > e2.getKey() ? 1 : -1; } }); return entries; } HMapII(int initialCapacity, float loadFactor);  HMapII(int initialCapacity);  HMapII();  HMapII(MapII m); @Override int size(); @Override boolean isEmpty(); @Override int get(int key); @Override boolean containsKey(int key); @Override int put(int key, int value); @Override void putAll(MapII m); @Override int remove(int key); @Override void clear(); @Override boolean containsValue(int value); @Override Object clone(); @Override Set<Integer> keySet(); @Override Collection<Integer> values(); @Override Set<MapII.Entry> entrySet(); @Override String toString(); @Override void plus(MapII m); @Override long dot(MapII m); @Override void increment(int key); @Override void increment(int key, int value); MapII.Entry[] getEntriesSortedByValue(); MapII.Entry[] getEntriesSortedByValue(int n);  }### Answer:
@Test public void testSortedEntries4() { HMapII m = new HMapII(); MapII.Entry[] e = m.getEntriesSortedByValue(); assertTrue(e == null); }