What are three ways to deal with collisions when implementing a hashing algorithm where the hash is not a perfect hash

. Sorting technique uses Divide and Conquer Strategy. QUESTION 2 ..is a technique where linked lists are used to take care of the collision from hash table.

We are using a subpar hash map, where each value is accumulated in a single container. A hash map has successfully achieved its purpose.

Suppose these names have the following hash values. Each leaf can only hold 4 entries. Insert them into the extendible hash table shown below. Note that the first two names have already been inserted. Illustrate each operation that occurs. Bob 0100 Sue 1000 Tim 1110 Ron 0010 Ann 1010 Jan 1101 Ben 0001 Don 0101 Tom 1111 Sam 1011 (1) (1) Bob 0100 Sue 1000