Consider a hash table of size 7 with hash function h(k) = k mod 7. Draw the table that results after inserting in the given order, the values, 15, 25, 12, 43, 17, 21, 79 for each of the scenarios below: i) When collisions are handled by separate chaining. ii) When collisions are handled by linear probing. iii) When collisions are handled by double hashing. Using a second hash function h'(k)=5-(k mod 5).

How can you differentiate hash table from the direct addressing table?

Use a hash table of size 7 with separate chaining, linear probing, and double hashing to insert: 19, 26, 13, 48, 17. Show the resulting tables.