Problem $3$: $[10$ marks$]($You can work on this problem with another classmate.$)$

Design and write a Java program for a dynamically resizable hash table to store students' names and

their student numbers. Use the extraction method with division using the last four digits of the student

number. Use an initial table size of $31$ and a load factor of $0\mathrm{.}8.$ Use open addressing with double

hashing using an extraction method on the first three digits of the student number. Show how your

program performs with more than $50$ student data $($If you are going to use artificial data, they should be

generated randomly$).$

Please provide the code in Java and do not provide complex code