Task 7 fashing, Practice (oints 10 minules): Pil in the hash tables with numbers a hash siotsf For each insertion, keep the preeiously inserted numbers inside! the 1 In-ert the numbers on the right to the hash table with linear probing, The hash function is h(r) h% 11: 0128 45 6 7 89 10 Task: Insert 15 Insert 16 Insert 11 Insert 26 Insert 18 2. Insert the numbers on the right to the hash table with double hashing. The first hash function is h(z), h%11 and the second hash function is h(z) 0 1 2 3 4 5 6 7 8 9 10 Task h%7; Insert 15 Insert 16 Insert 11 Insert 26 Insert 18 Task 8 Hashing, Chaining (10 points / 10 minutes): Explain the advantages and disadvantages of using separate chaining in lists for storing entries in a hash table, compared to probing strategies for finding free slots in a hash table without chaining