1. Using big O notation, say how long it takes (ideally) to find an item in a hash table. 2. A __________ transforms a range of key values into a range of index values. 3. Open addressing refers to a....

1.
Using big O notation, say how long it takes (ideally) to find an item in a hash

table.

2.
A __________ transforms a range of key values into a range of index values.

3.
Open addressing refers to

a.
keeping many of the cells in the array unoccupied.

b.
keeping an open mind about which address to use.

c.
probing at cell x+1, x+2, and so on until an empty cell is found.

d.
looking for another location in the array when the one you want is

occupied.