using big notationsay how long it takes (ideallyto find an item in hash table transforms range of key values into range of index values open addressing refers to keeping many of the cells in the array unoccupied keeping an open mind about which address to use probing at cell + + and so on until an empty cell is found looking for another location in the array when the one you want is occupied using the next available position after an unsuccessful probe is called what are the first five step sizes in quadratic probing secondary clustering occurs because many keys hash to the same location the sequence of step lengths is always the same too many items with the same key are inserted the hash function is not perfect separate chaining involves the use of at each location reasonable load factor in separate chaining is true or falsea possible hash function for strings involves multiplying each character by an ever-increasing power the best technique when the amount of data is not well known is linear probing quadratic probing double hashing separate chaining if digit folding is used in hash functionthe number of digits in each group should reflect true or falsein linear probing an unsuccessful search takes longer than successful search