#4. Open Addressing Strategies (8 points) (a) (2 pts): Show the table that results when 9,32,1, 66,40, 20,51,10 are cumulatively inserted in that order into an initially empty hash table of size 11 with linear probing and h'(k) - k mod 11 h(k,i) - (h'(k) + i) mod 11, where the first probe is probe i-0. Draw this and the next result as horizontal arrays indexed from 0 to 10 as shown below. (You can fill in the Google Doc table.) Show your work in part (b) to justify your answer! 3 4 8 9 10 (b) (1 pt): How many re-hashes after collision are required for this set of keys? Show your work here so we can give partial credit or feedback ifwarranted. (c) (2 pts): Show the table that results when 9, 32, 1, 66, 40, 20, 51, 10 are cumulatively inserted in that order into an initially empty hash table of size m 11 with double hashing and h(k,fi)- (h,(k) + ih2(k)) mod 1'1 h,(k)- kmod 11 h2(k)- 1 + (k mod 7) Refer to the code in the book for how i is incremented. Show your work in part (d) to justify your answer! 4 10