Hashing with Chaining (a) (6 pts) Fill in the table below after inserting 20, 51, 10, 19, 32, 1, 66, 40 (in this order) into an initially empty hash table of size 11 with chaining and h(kkmod 0 2 3 4 5 10 Open Addressing with Linear Probing (b) (5 pts) Fill in the table below after inserting 20, 51, 10, 19, 32, 1, 66, 40 (in this order) into an initially empty hash table of size 11 with linear probing and h(k,i((k) i mod 11 h'(k) = kmod 11