Impliment a class for double hashing based off of the code provided below.

Hints: It should be pretty similar except the findSlot method.

If you need any othert classes such as AbstractMap, MapEntry etc and I would be happy to post them.

import java utilIterator: public class ProbeHash Table extends AbstractHashMapi private MapEntryll table; private MapEntry DEFUNCT private int count 0 new MapEntry(null, null); public ProbeHashTable)i superD public ProbeHashTable(int cap,int p) super[cap, p): private boolean compareStr(String s, String t) count return s.equalst protected void createTable0 table new MapEntry[capacityl: private boolean isAvabl(int i) return(tablntableiDEFUNCT): private int findSlotint h, String k) I int available1; intj h; do if isAvailable)) if(available1) available j if(tablelil null) break: else iffcompareStr(tablelil.getKey),k)) return j js (j + 1) % capacity; whilej!h) return -(1); import java utilIterator: public class ProbeHash Table extends AbstractHashMapi private MapEntryll table; private MapEntry DEFUNCT private int count 0 new MapEntry(null, null); public ProbeHashTable)i superD public ProbeHashTable(int cap,int p) super[cap, p): private boolean compareStr(String s, String t) count return s.equalst protected void createTable0 table new MapEntry[capacityl: private boolean isAvabl(int i) return(tablntableiDEFUNCT): private int findSlotint h, String k) I int available1; intj h; do if isAvailable)) if(available1) available j if(tablelil null) break: else iffcompareStr(tablelil.getKey),k)) return j js (j + 1) % capacity; whilej!h) return -(1)