Consider the Formula for Evaluating the Number of Hash Table $c=1 / 2^{(1+1 /(1-L))}$

Multiple Choice

Consider the formula for evaluating the number of hash table comparisons:
$c=1 / 2^{(1+1 /(1-L) ) }$ , where c = the number of comparisons and L = the load factor.
Given that a hash table of size 100,000 contains 20,000 items, how many comparisons are expected in a linear probe for an item?

A) .5
B) .625
C) 1.125
D) 3