Use Java to Create a hash table class/struct.

Define an array that holds 27 elements.

Define a function called Hash(int)

-This function returns the modulo of that int by the size of the table (array).

Define an add function that takes an integer.

-This function takes the integer, determines the hash of that number by calling the above hash function, then adds it to the table using linear probing for collision resolution.

Define a function that looks up a value, it takes an integer, return -1 if the value is not in the table.

Create a main that allows the user to add and lookup items in the table.