Draw the linear-probing hash table that results when you insert the keys 4 21 22 3 8 29 34 n that order, into an initially empty table. Use the hash function h(k) = (2k + 4) %13 2 points) Using the hash functions hy (k)=k%11 and h(k) = 1+ (k%9), show the result of inserting the keys 27 51 69 26 38 62 73 into an initially empty table using double hashing.