Question $7$

$0\mathrm{.}25pts$

Suppose that the universe $U$ has the keys $"$O$...,$n$2-1\}$ for a hash table of size $n,$ what is the greatest number of distinct keys that table can hold with chaining as the collision resolution strategy?

n$2-1$

n$2$

n

$n2+1$