Using Java

Problems 1) (80 Points, 20 points each) Given a hash table of 17 elements, input of (43, 71, 13, 23, 61, 73, 39,99 44, 16) and the hash function h(x)-x % 17, where x is the input value and h(x) is the resulting hash value, show the hash tables resulting from: a) inear probing b) quadratic probing c) using a secondary hash function h'(x)-7-x % 7 d) separate chaining