(b) Draw the tree after performing find(b) on the tree rooted at b using Find function with collapsing rule. (10%) a b c d f e g h i

六、 Double hashing A hash table with size 7 is used to store integer keys. Double hashing is used to resolve collisions. The hash function is H(x) = k mod 7, and the second hash function is H2(k) = number of digits in k. (a) Fill in the contents of the hash table after inserting 701, 74, 9, 16, 708. Your answer should be in the form: (10%)