You are designing a spell-checker application that uses a hash table to store a large dictionary of words. Which collision-resolution technique would you choose for this application, and why?a)Linear probing, for its simplicity and ease of implementation.b)Separate chaining, for its ability to handle a large number of words efficiently.c)Quadratic probing, for its deterministic probing sequence.

For a spell-checker application that uses a hash table to store a large dictionary of words, I would choose separate chaining as the collision-resolution technique.

The reason for this choice is that separate chaining can handle a large number of words efficiently. In separate chaining, each element in the hash table's array is a linked list. All the elements that hash to the same index are placed in the same linked list. This allows the hash table to handle collisions by simply adding the new element to the end of the list.

This method is particularly efficient when dealing with a large number of words because it avoids the problem of clustering that can occur with linear and quadratic probing. Clustering can significantly slow down the lookup time, which is a critical factor for a spell-checker application.

In contrast, linear probing and quadratic probing involve finding the next available slot in the array when a collision occurs. This can be more complex to implement and can lead to clustering, especially when the hash table is nearly full.

Therefore, for a spell-checker application with a large dictionary of words, separate chaining would be the most efficient and effective collision-resolution technique.