单选题：Insert {20, 25, 13, 22, 4, 9, 29, 35, 14, 17} one by one into an

Insert {20, 25, 13, 22, 4, 9, 29, 35, 14, 17} one by one into an initially empty hash table of size 13 with the hash function H(Key)=Key%13, and quadratic probing is used to resolve collisions. How many numbers can be inserted without collisions? @[C](2)

A. 5
B. 6
C. 7
D. 8




A.5
B.6
C.7
D.8


答案：C