Please help me to write a Java Programming:

$-$ Use a simple array to implement a hash table, suppose the key universe U$=\{0,1,...,29\},$ in other words, this hash table has $30$ slots. The table uses $-1$ to denote empty slots.

$-$ Suppose we use the division method to hash the values to the slots, and $()=31.$ Implement an insertion function and a search function to:

$*$ Insert: $\{23,0,85,105,339,12,58,41,568,140,51,165\}$ into the table

$*$ Search: $\{23,12,568\}$ in the table

$1)$ the whole table after every insertion.

$2)$ the number of probes for each search.