Assume simple uniform hashing and an initially empty hash table of size n. Assuming no deletions, about how many insertions are required before each slot of the table has at least one element? n10nnlog(n)n22n None of the other choices