Questions 59－60 are based on the following informationA hash table With hash functionh1(k)

Questions 59-60 are based on the following information

A hash table With hash function

h1(k)=k mod 13

Is shown below．

Collision is resolved using the hash function H2(k)=(k mod 11)+1

How many key comparisons occur in searching for key 35 in the given hash table?

A．0

B．1

C．2

D．3