Consider a Hash table with separate chaining with N buckets and k items currently in the table.

1) k=N is the definition of a term used when discussing hashing. What is this term?

2) Is it necessary that k < N?

3) What is the average number of items in a bucket?

4) In the worst-case, how many items could be in a single bucket?

5) If k > N, is it possible that any buckets are empty?

6) If we resize the table to a table of size 2N, what is the asymptotic running time in terms of k and N to put all the items in the new table?