Consider a hash table with linear probing. The hash function is h(x, i) = h'(x) mod 8 h' (2) = (17x + 1) mod 23) mod 8 (1) Draw the hash table content after inserting the following keys: data = [7, 13, 1, 12]. (2) Calculate the average number of slots accesses for each unsuccessful search on the above hash table