单选题：If the hash values of $$n$$ keys are all the same, and linear pr

If the hash values of $$n$$ keys are all the same, and linear probing is used to resolve collisions, then the minimum total number of probings must be __ to insert these $$n$$ keys . @[D](2)

A. $$n(n-1)/2$$
B. $$2n+1$$
C. $$2(n+1)$$
D. $$n(n+1)/2$$




A.$$n(n-1)/2$$
B.$$2n+1$$
C.$$2(n+1)$$
D.$$n(n+1)/2$$


答案：D