单选题：Given an initially empty hash table `HT` with length 7, together

Given an initially empty hash table `HT` with length 7, together with a hash function $$H(k)=k\% 7$$. Let us use linear probing to solve collisions. What is the average search length for successful searches after inserting 22, 43, 15 one by one into `HT`? @[C](2)

A. 1.5
B. 1.6
C. 2
D. 3




A.1.5
B.1.6
C.2
D.3


答案：C