Given the Hash table displayed below, we ask for the resulting array index when inserting elements into the table using the specified hash function, resolving collisions with linear probing, quadratic problem and double hashing. For each insertion, restart with the given table. 0 1 2 3 4 5 6 7 8 9 10 11 23 42 9 Insert 3 using the hashing function hk, i) = (h'(k) +i) mod 11 with h' (k) = k mod 5. Index: Insert 13 using the hashing function h(k, i) = (h'(k) + 2i +i?) mod 11 with h'(k) = k mod 5. Index: Insert 4 using the hashing function h(k, i) = (h'(k) +i h"(k)) mod 11 with h'(k) = k mod 5 and h"(k) =1+(k mod 10). Index