What is a recommended practice when a single element is no longer needed in a hash table that resolves collisions using Separate Chaining?

A) Return an error to the user that deletions of data are not permitted

B) Do not return an error but leave the data there any way

C) Just delete the data

D) Delete the element data but leave a marker to indicate that the element was deleted

E) Delete the element data and rebuild the entire hash table

Which steps should be considered to help yield an expected constant-time lookup in a hash table?

***Multiple answers:You can select more than one option**

A)

Change the number of elements being stored

B)

Use a hash function that is uniformly distributed

C)

Make the size of the table proportional - by ia constant factor - to the number of elements in the table

D)

Occasionally expand the hash table as the number of elements it contains grows