Answer Happy

LinearCollisionHandler.java
CollisonHandler.java
package structures; public class LinearcollisionHandler ⟨K⟩ implements collisionHandler ⟨K⟩ \ private int probelength; Constructors to set probelength to 1 , or a different length. " public LinearcollisionHandler() | this.probelength =1; public LinearcollisionHandler(int probeLength) \{ I 1 this.probelength = probeLength; * Method starts at index and searches linearly until an-oper - is found in the array. This could inc ∗ public int probe(int index, boolean[] activeArray, int M ) \{ | 1 i. Inplement this method, ) Start at index and search the array linearly until the target - is found. Then return the array index of the target. * Return -1 if not found. * / |public int search(int startindex, K target, K[] keyArray, boolean [] activeArray, int M ) \{ 1/ : Implement this method.
backage structures; /** * This interface defines methods for handling collisions in an arri * using open addressing to resolve collisions. * The hashtable uses an array of type K to store keys, and an array * where true indicates an active cell in the array and false indici 菊 public interface CollisionHandler ⟨K⟩{ * Method starts at index and searches linearly until an open spot * is found in the array. "This could include index itself. * public int probe(int index, boolean[] activeArray, int M); * Start at index and search the array linearly until the target * is found. Then return the array index of the target. * Return -1 if not found. 麦/ I public int search(int startIndex, K target, K[] keyArray, booleat