单选题：Given an initially empty hash table HT of size 11. The hash fun

Given an initially empty hash table HT of size 11. The hash function is $$H(key)=key\% 7$$, with linear probing used to resolve the collisions. Now hash the keys 87, 40, 30, 6, 11, 22, 98 and 20 one by one into HT. What is the average search time for unsuccessful searches? @[C](2)

A. 4
B. 5.25
C. 6
D. 6.29




A.4
B.5.25
C.6
D.6.29


答案：C