Please provide an implementation of a hash table using chaining in Java, along with a test using a sample array?

$$ UniversalHash Class: This class should define a universal hash

function that uses random coefficients a and b$.$

$$ ChainedHashTable Class: This class should implement the hash

table with chaining, including methods for inserting $($set$),$ retrieving

$($get$),$ and displaying the contents of the hash table.

$$ Testing: The code should test the hash table with a sample list of $10$

people and their email addresses, where each name serves as the

key and the corresponding email is the value. It should display the

contents of the hash table and verify the retrieval of both existing and

non$-$existing keys.