Hash table is a data structure in which keys are mapped to array positions by a hash function. The process of mapping the keys to appropriate locations in a hash table is called hashing. Hash functions are used to reduce the number of collisions. i. Mention the methods to minimize collision. ii. Explain the advantage of using double hashing over linear and quadratic probing techniques. iii. Load the keys given below in a hash table of size 6 in the same order using chaining with the hash function h(key)= key % 6. Show graphically how collisions are resolved using chaining in this particular case. 12, 105, 3, 21, 13, 16, 7, 153