Program Exercise (Can be done either in Java or C):

Implementing a hash table with insertion, deletion and searching by using the double hashing method. Your double hashing is of h(k) = i + jd(k)mod N and d(k) = q - k mod q. Pick q as the largest prime thats less than N.

*/Sample input: Sequence of random integers "1.in 4.in 6.in 4.del 8.in 10.in 13.in 1.sch 19.in". Once the hash table is full stop your input. Sample output: Two output sets should be displayed with one being before and the other after the operation. Not that output of sch is to be "found" or "not found". Sample output format

0:

1: 1

2:215

3:

4: ...

12:12

If duplicate is inserted please display "duplicate key". */

Please help me with this exercise will rate! Thank you!