1) Consider a hash table of size 7 with hash function h(k) = k mod 7. Draw the hash table after inserting in it, in the given order, the following values into the table: 14, 28, 2, 26, and 70:
(a) When linear probing is used to resolve collisions
(b) When double hashing with secondary hash function h′(k) = 5-(k mod 5) is used to resolve collisions.