/*dictionary implemented using hashing *class hashdictionaryeimplements dictionary private static final int defaultsize private hashtable /the hash table private int count/of records now in table private int maxsize/maximum size of dictionary hashdictionary(this(defaultsize)hashdictionary(int szt new hashtable(sz)count maxsize szpublic void clear(/*reinitialize * new hashtable(maxsize)count public void insert(key ke /*insert an element *assert count maxsize "hash table is full" hashinsert(ke)count++public remove(key /*remove an element * temp hashremove( )if (temp !nullcount--return temppublic removeany(/*remove some element *if (count ! count--return hashremoveany()else return null/*find record with key value " *public find(key kreturn hashsearch( )/*return number of values in the hash table *public int size(return countfigure partial implementation for the dictionary adt using hash table this uses poor hash function and poor collision resolution policy (linear probing)which can easily be replaced member functions hashinsert and hashsearch appear in figures and respectively