Given an initially empty hash table of capacity 13 , insert the key- value pairs shown below (in the order shown) into the hash table using each of the four different collision resolution strategies that we covered in lecture. For each strategy, please show the final hash table and also show the computations that you made in order to insert each key-value pair. For this exercise, you may assume that no rehashing is performed (a) Separate Chaining (b) Linear Probing with $f(i)=i$ (c) Quadratic Probing with $\mathrm{f}(\mathrm{i})=\mathrm{i}^{\wedge} 2$ (d) Double Hashing with $f(i)=i*{*} g(k)$, where $g (k)=11-(k \bmod 11) $ Insert the following key-value pairs: (26, "Kate") (33, "Bob") (11, "John") (42, "Mike") (52, "Amy") (25," "Jane") (55," "Steven") (38, "Liz") cs. vs. 1230|