Data Structure ( comp sci project)

10.36. Describe how to redesign the AbstractHashMap framework to include support for a method, containsKey, as described in Exercise R-10.3. Modify the ChainHashMap class in accordance with your design for the previous exercise.
10.37. Modify the ProbeHashMap class in accordance with Exercise C-10.36.
Exercise C-10.36
Redesign the AbstractHashMap framework to include support for a method, containsKey, as described in Exercise R-10.3.
Exercise R-10.3
The use of null values in a map is problematic, as there is then no way to differentiate whether a null value returned by the call get(k) represents the legitimate value of an entry (k,null), or designates that key k was not found. The java.util.Map interface includes a boolean method, containsKey(k), that resolves any such ambiguity. Implement such a method for the UnsortedTableMap class.
10 points. Provide two call chains (or stacks) starting with containsKey() for ChainHashMap, one call chain, and for ProbeHashMap, the other call chain. Each method in the call chain should have next to it the class where is implemented. For example:
methodA() (ClassA) -> methodB (ClassB) -> methodC (ClassC)