The table is a hash table.

2. Consider a version of table deletion where we replace the table of size s with a table of size (s - 1000) whenever the table has 1000 or more empty locations. Each deletion which does not change the table size takes (1) time. Resizing the table takes cs time where s is the size of the table being replace. Analyze the TOTAL time to delete n elements from a table of size n. Explain your answer. 2. Consider a version of table deletion where we replace the table of size s with a table of size (s - 1000) whenever the table has 1000 or more empty locations. Each deletion which does not change the table size takes (1) time. Resizing the table takes cs time where s is the size of the table being replace. Analyze the TOTAL time to delete n elements from a table of size n. Explain your