Consider a hash table of size 8 and the following sequence of keys x (with hash values h(x)) to be inserted. X h(x) 37 6 85 17 73 27 9 5 6 5 1 1 3 1 a. Insert the keys into the hash table and resolve collisions by chaining. Draw the state of the hash table after every insertion. b. Insert the same keys into the hash table and resolve collisions by linear probing. Draw the state of the hash table after every insertion.