Exercise 2 (for week of Mar 1-5)

(A) Consider linear probing in which instead of using 
  A_i(k) = (h(k) + i) mod m we use A_i(k) = (h(k) + d*i) mod m where
  d is a some fixed integer (say 2 or 3). Consider two cases
   * d divides m
   * d does not divide m
  Will it suffer the same "clustering problem" the regular linear 
  probing (in which d=1) has?

(B) Consider a hash table using open addressing with linear probing.
Give an algorithm for deletion so that deleting
a key leaves the table exactly as it would have been had
that key not been inserted (except perhps the ordering of elements is different)..
Prove that your algorithm is correct.