chap searching ( (bfigure example of problems with linear probing (afour values are inserted in the order and using hash function (kk mod (bthe value is added to the hash table in slot with probability / this is illustrated by figure (bthis tendency of linear probing to cluster items together is known as primary clustering small clusters tend to merge into big clustersmaking the problem worse the objection to primary clustering is that it leads to long probe sequences improved collision resolution methods how can we avoid primary clusteringone possible improvement might be to use linear probingbut to skip slots by constant other than this would make the probe function (kiciand so the ith slot in the probe sequence will be ( (kicmod in this wayrecords with adjacent home positions will not follow the same probe sequence for exampleif we were to skip by twosthen our offsets from the home slot would be then then and so on one quality of good probe sequence is that it will cycle through all slots in the hash table before returning to the home position clearly linear probing (which "skipsslots by one each timedoes this unfortunatelynot all values for will make this happen for exampleif and the table contains an even number of slotsthen any key whose home position is in an even slot will have probe