You also must implement one non-linear data structure a HashMap. Please write your code in the MapDS.java class. Feel free to implement any additional classes you may need to complete this assignment. Make sure you include those classes in your zip file submission. Make sure you use value equalities checking. Warning, my code will put null values into your data structures.

//////// java

package student;

import java.util.Map;

public class MapDS { /** * Removes all of the mappings from this map. */ public void clear(){

}

/** * Returns true if this map contains a mapping for the specified key. * @param key * @return */ public boolean containsKey(K key){ return false; }

/** * Returns true if this map maps one or more keys to the specified value. * @param value * @return */ public boolean containsValue(V value){ return false; }

/** * Returns the value to which the specified key is mapped, or null if this * map contains no mapping for the key. * @param key * @return */ public V get(Object key){ return null; }

/** * Returns true if this map contains no key-value mappings. * @return */ public boolean isEmpty(){ return false; }

/** * Associates the specified value with the specified key in this map. * @param key * @param value */ public void put(K key, V value){

}

/** * Copies all of the mappings from the specified map to this map. * @param m */ public void putAll(Map m){

}

/** * Removes the mapping for a key from this map if it is present. * @param key * @return */ public void remove(Object key){

}

/** * Removes the entry for the specified key only if it is currently mapped to the * specified value. * @param key * @param value * @return */ public void remove(Object key, Object value){ }

/** * Replaces the entry for the specified key only if it is currently mapped to some value. * @param key * @param value * @return */ public void replace(K key, V value){

} /** * Replaces the entry for the specified key only if currently mapped to the * @param key * @param oldValue * @param newValue * @return */ public void replace(K key, V oldValue, V newValue){

} /** * Returns the number of key-value mappings in this map. * @return */ public int size(){ return 0; }

}