Part A Problems from the textbook $[30pts$

$($AI$).11\mathrm{.}2-2($p$261)[15$ pts $]$

Demonstrate what happens when we insert the keys $5,28,19,15,20,33,12,17,10$ into a hash table with collisions

resolved by chaining. Let the table have $9$ slots and let the hash function be $h(k)=k$ mod $9.$ Tips: plot the hash table with

chaining.

$($A$2).12\mathrm{.}1-1($p$289)[15$ pts $]$

For the set of $\{1,4,5,10,16,17,21\}$ of keys, draw binary search trees of heights $2,3,4,5,$ and $6.$