Draw the 11 -item hash table resulting from hashing the keys $12,44,13,88, 2394,11,39,20,16$, and 5 , using hash function $h(k)=(2 k+5)$ mod 11, assuming collisions are handled by each of the following: a. Separate chaining. b. Linear probing. c. Quadratic probing up to the point where the method fails because no empty slot is found. d. Double hashing using the secondary hash function $h^{\prime} (k)=7-(k \bmod 7)$. CS.VS. 1360