Data Structures and Analysis

A linear-probing hash table of length 10 uses the hash function h(x)=x mod 10 . After inserting six integer keys into an initially empty hash table, the array of keys is: a) 46,42,34,52,23,33 b) 34,42,23,52,33,46 46,34,42,23,52,33 d) 42,46,33,23,34,52 e) 42,23,34,52,46,33