a large number of deletions in a separate chaining hash table can cause the table to be fairly empty, which wastes space. in this case, we can rehash to a table half as large. assume that we rehash to a table twice the size when there are twice as many elements as the table size. how empty should the table be before we rehash to a smaller table? justify your answer.