In Java!

This assigament is due on 08/02/18 at 11:59:59am. Task: Implementation of the ProbeHash Table class with linear probing. The template of ProbeHash Table class and relevant classes are given below public class ProbeHashTable extends AbstractHashMap ( private MapEntry table; private MapEntry DEFUNCT = new MapEntry ( null,null); //constructors protected void createTable I/ your implementation here private boolean isAvailable(int i) ( II your implementation here private int findSlot (int h, String k) ( I/ your implementation here protected Object bucketPut (int h, object key, object value) II your implementation here protected Object bucketGet (int h, object key) I your implementation here protected Object bucketRemove(int h, object key) t I/ your implementation here public String tostring) ( II convert the ProbeHashTable object to a string in the format of / index key value" tuples, for example CSU CLE PLAY OHIO HOUSE blic class MapEntry ( private String keyi private String value: /I constructor public String getKey( (return key:) public String getValue() (return value;h public int hashCode) int h0 for (int ?#0; ?ckey. length ()) { h +- ( int) key. charAt ( ? ) ; return h