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: (a) An array that holds hash table (b) A variable for array size (c) Constructor (d) Method to display the table (e) Method for the hash function (f) Method to insert a DataItem (g) Method to delete a DataItem & (h) Method to find item with key Create a main program HashTableApp to demonstrate the operations listed above with the hash table using linear probing. 2. Modify the above program to implement a linear probe hash table that stores strings. You will need a hash function that converts a string to an index number. Assume the strings will be lowercase words, so 26 characters will suffice. 3. Modify the program you developed in (1) to use quadratic probing. * I want the tracing and the algorithm for this question.