In a linear-probing hash table with M lists and N = alpha * M keys (where alpha is the load factor), the average number of probes (under the uniform hashing assumption) required for search hits is
A. ~ ½ (1 + 1/(1-alpha))
B. none of these choices
C. (1 + 1/(1-alpha) squared)
D. ~ ½ (1 + 1/(1-alpha) squared)
E. (1 + 1/(1-alpha))