Develop a program in Java to demonstrate the operations of a Hash Table. Use the following class DataItem that contains just one field, an integer that is its key. class DataItem{ private int iData; public DataItem(int i){ iData = i; } public int getKey(){ return iData; } } Using the above class, design a class HashTable that will have the following: (f) An array that holds hash table (g) A variable for array size (h) Constructor (i) Method to display the table (j) Method for the hash function (k) Method to insert a DataItem (l) Method to delete a DataItem & (m) Method to find item with key Create a main program HashTableApp to demonstrate the operations listed above with the hash table using Universal Hashing.

p.s==> I want the tracing and the algorithm for this question.

thanks