Suppose we are implementing quadratic probing with a hash function hash(x) = x mod 100. If an element with key 4592 is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is

0

1

9

95

none of the above