write code JAVA Exercise $3$:

The load factor is defined as alpha $=$ N$/$M$,$ where N is the size of the input $($the number of keys$),$ and M is the output size $($the hash$\_$table$).$ If alpha is small, i$.$e$.,$ the hash table is large, there will be fewer chances of collision.

Modify your code in Exercise $1$ to do the following:

Set alpha to $0\mathrm{.}5($which means M $=2$N$).$ Use a random input and fill the hash table.

Generate a random key and search it in the hash table. Count the number of comparisons

you had to make $($regardless the search was successful or not$).$

Do step $2($the search operation$)$ several times $($at least $10$ times$)$ for a different key in the

same hash table. Every time note down the number of comparisons.

Write the number of comparisons in table form and their average in the space provided

below.

Iteration # $1$

$23$

# of comparisons xxx

xxx xxx