Imagine that you alter the linear probing scheme of Segment 21.13 as follows. When a collision occurs at hashTable[k], you check hashTable[k + c], hashTable[k + 2 * c], hashTable[k + 3 * c], and so on, where c is a constant. Does this scheme eliminate primary clustering?