I need help with following:

Consider a modulo hash function and the following hash table.

Nums Table:

0)

1) 11

2) 22

3)

4)

5) 45

6)

7) 47

8)

9) 39

1)

How many buckets will be checked for HashSearch(numsTable, 45)?

1

6

10

2)

If item keys range from 0 to 49, how many keys may map to the same bucket?

1

5

50

3)

If a linear search were applied to the array, how many array elements would be checked to find item 45?

1

6

10