2. (10 points) Demonstrate what happens when we insert the keys <5, 28, 19, 15, 20, 33, 12, 17, 10> into an empty hash table with collisions resolved by chaining. The hash table has 7 slots, and the hash function $h(k) = k \mod 7$.
3. (15 points)
On this binary search tree T,