Problem#3L(35 pts) (a) Draw the hash table of TableSize 11 resulting from hashing the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 using the hash function h(key)-(2*key +5) mod TableSize and handling collisions using separate chaining. Justify. (b) Redo with linear probing. Justify. (c) Redo with quadratic probing. Justify. (d) Redo with double hashing and the second hash function being v(key)7 - (key mod 7). Justify (e) Consider two sets of integers, Ss1, S2, .., Sm and Tti, 2, ..., tnl, m s n. Propose a O(n+m) running time complexity algorithm (only pseudo-code) that uses a hash table of size m to test whether S is a subset of T. Important Notes: For problem #3, you don't need to submit any implementation in Java. For parts (a) (d) of this problem, you must draw the hash tables using the appropriate graphics tools at your convenience. Hash tables that were drawn by hand will be not accepted