25 Points) Insert the keys 8, 4, 11, 20, 15, 17, 10 in order into a hash table that uses open addressing with linear probing with an initial size of 6. The hash function is defined as: h(k) = k mod SIZE , where SIZE is the current size of the table (initially, SIZE = 6). Rehashing should be performed as soon as the table is completely full, and will double the size of the table (note that the increased table size here is not required to be a prime number). Show how the table looks like immediately before the rehash, as well as the final result after all insertions.