Question V $[$Hashing$]$: Insertion, Searching, and Deletion in Open Addressing Consider a hash table of size $11,$ using double hashing as the collision resolution technique. The primary hash function is

$h(k)=$kmod$11$

and the secondary hash function is

$h_p(k)=5-(kmod5)$

$(11$ points$)$ Insert the following keys in the order given into the hash table: $27,18,29,28,39,13,16.$ Show each step and how the secondary hash function resolves any collisions. Show the resulting hash table.

$(5$ points$)$ Search for keys $39$ and $22$ in the table. Determine the visited hash table cells during each search and whether or not the key is found.

$(4$ points$)$ Delete key $18$ from the hash table and redraw the updated hash table.