he following hashTable uses open addressing with linear probing and this hash function:

h(street_address) = street_number % 5

0	null
1	76 Green
2	available
3	22 Lombard
4	null

How many seeks will it take to determine that "92 Sarasota" is not in the table?

If you look in a position in the table, that counts as a single seek. For example, if you looked in positions 0 and 1 in order to determine that 92 Sarasota was not in the table, that counts as 2 seeks.