Explain why the average time complexity of searching for elements in a hash table, where conflicts are resolved by chaining, decreases as its load factor a decreases. Recall that a is defined as the ratio between the total number of elements stored in the hash table and the number of slots in the table.

This is a Data Structures and Algorithms subject Question.