If memory is limited and the entire dictionary cannot be stored in a hash table, we can still get an efficient algorithm that almost always works. We declare an array H_TABLE of bits (initialized to zeros) from $0$ to TABLE_SIZE $– 1$. As we read in a word, we set H_TABLE[hash(word)] $= 1$. In this scenario, which of the following is true?
@Bikram Sir please provide the solution.