I have HasingTester.java

$//*************************************************************************$

$//***$You must use all the given methods without changing their signature.$**$

$//***$However$,$ you may add new methods using the given ones if necessary.$***$

$//*************************************************************************$

import java.util.Random;

import java.util.Scanner;

public class HashingTester $\{$

public static void main$($String$[]$ args$)\{$

Scanner scan $=$ new Scanner$($System$.$in$)$;

System.out.print$("$Enter load factor $($lambda$)$ between $0\mathrm{.}1$ and $0\mathrm{.}9$: $")$;

double lambda $=$ scan.nextDouble$()$;

double size $=$ Double.valueOf$(10000)/$lambda;

int hashTableSize $=$ findTheNextPrime$(($int$)$size$)$;

System.out.print$("$Enter probe type $(1$ for linear, $2$ for quadratic$)$: $")$;

int probeType $=$ scan.nextInt$()$;

int$[]$ randomIntegers $=$ generateRandomIntegers$($probeType$,$ hashTableSize, lambda$)$;

$\}$

$//$ method to find the next prime integer

public static int findTheNextPrime $($int N$)\{$

$//$ Implement checkMove here

$//*********$The error will go away once you implement and returns an int value$*********$

$\}$

$//$ method to find the next prime integer

public static int$[]$ generateRandomIntegers $($int probeType, int hashTableSize, double lambda$)\{$

int$[]$ theArray $=$ new int $[$hashTableSize$]$;

Random r $=$ new Random$()$;

int low $=1$;

int high $=$ hashTableSize;

if$($probeType $==1)\{$

LinearProbing lProbing $=$ new LinearProbing$($hashTableSize$)$;

for$($int j $=0$; j$<mn\; id="EditorElement\_1661640">1</mn><mn\; id="EditorElement\_1661641">0</mn><mn\; id="EditorElement\_1661642">0</mn><mn\; id="EditorElement\_1661643">0</mn><mn\; id="EditorElement\_1661644">0</mn>$; j$++)\{$

$//$inputting random value to an array

lProbing.getHashIndex$($r$.$nextInt$($high$-$low$)+$ low$)$;

$\}$

System.out.println$("$Actual $($average$)$ cost: $"+$lProbing.getCost$()/$Double$.$valueOf$(10000))$;

$//$ call linearExpectedNoOfProbes$($lambda$)$;

$\}$

else if$($probeType $==2)\{$

$//$ repeat the exact above steps for the quadratic probing

$\}$

$//$

return theArray;

$\}$

public static void linearExpectedNoOfProbes$($double lambda$)\{$

double epCost $=0\mathrm{.}5*(1\mathrm{.}0+(1\mathrm{.}0/(1\mathrm{.}0-$lambda$)))$;

System.out.println$("$Expected cost $($from the equation$)$: $"+$String.format$("\%,\mathrm{.}4$f$",$ epCost$))$;

$\}$

public static void quadraticExpectedNoOfProbes$($double lambda$)\{$

$//$double epCost $=$ repeat the above step for the quadratic probing;

$//*********$The error will go away once you implement epCost$*********$

System.out.println$("$Expected cost $($from the equation$)$: $"+$String.format$("\%,\mathrm{.}4$f$",$ epCost$))$;

$\}$

$\}$

LinearProbing.java

$//*************************************************************************$

$//***$You must use all the given methods without changing their signature.$**$

$//***$However$,$ you may add new methods using the given ones if necessary.$***$

$//*************************************************************************$

public class LinearProbing $\{$

private static int currentSize $=0$;

private static int cost $=0$;

private int maxSize;

private Integer$[]$ hashTable;

public LinearProbing$($int maxSize$)\{$

this.maxSize $=$ maxSize;

this.hashTable $=$ new Integer$[$this$.$maxSize$]$;

$\}$

public int getCost$()\{$

return this.cost;

$\}$

$//$method to implement getHashIndex

public void getHashIndex$($int key$)\{$

$//$ Implement getHashIndex here

$\}$

$//$method to implement linear probing

public void probe$($int index, int key$)\{$

$//$ Implement linear probing here

$\}$

$\}$

QuadraticProbing.java

$//*************************************************************************$

$//***$You must use all the given methods without changing their signature.$**$

$//***$However$,$ you may add new methods using the given ones if necessary.$***$

$//*************************************************************************$

public class QuadraticProbing $\{$

private static int currentSize $=0$;

private static int cost $=0$;

private int maxSize;

private Integer$[]$ hashTable;

public QuadraticProbing$($int maxSize$)\{$

this.maxSize $=$ maxSize;

this.hashTable $=$ new Integer$[$this$.$maxSize$]$;

$\}$

public int getCost$()\{$

return this.cost;

$\}$

$//$method to implement getHashIndex

public void getHashIndex$($int key$)\{$

$//$ Implement getHashIndex here

$\}$

$//$method to implement quadratic probing

public void probe$($int index, int key$)\{$

$//$ Implement quadratic probing here

$\}$

$\}$