Show the contents of the final open addressing hash table with an initial size of 5. Each table should rehash when its load factor is about to go over 0.5 because of an insert. Use h1 = key % table_size as the hash function for all the parts. Consider each hash table to be separate, and independent of the other two.

a. Linear probing: Insert 14, insert 3, insert 25, delete 14, insert 5, insert 36, insert 15

b. Quadratic probing: Insert 5, insert 13, delete 5, insert 2, insert 11, insert 6, insert 24, insert 17.

c. Double hashing with h2 = (key % 4) + 1: Insert 4, insert 59, insert 15, insert 37, insert 26