this question can have more than one right answer. please, include the explanation with the answer.

Hash Functions - Time Complexity Unanswered Which steps should be considered to help yield an expected constant-time lookup in a hash table? 0 Select all that apply Change the number of elements being stored Use a hash function that is uniformly distributed Make the size of the table proportional - by ia constant factor - to the number of elements in the table Occasionally expand the hash table as the number of elements it contains grows Submit