Suppose that to mitigate the effects of secondary clustering we use as the collision resol...

Suppose that to mitigate the effects of secondary clustering we use as the collision resolution function f (i) = i • r(hash(x)), where hash(x) is the 32-bit hash value (not yet scaled to a suitable array index), and r(y) = |48271y(mod (231 − 1))| mod TableSize. (Section 10.4.1 describes a method of performing this calculation without overflows, but it is unlikely that overflow matters in this case.) Explain why this strategy tends to avoid secondary clustering, and compare this strategy with both double hashing and quadratic probing.