3. Use the table below to convert a character key to an integer for the following questions. Letter | A | B |C |D | E |F |G | H |1 |J |K | L |M Key 2 3 4 5 678 9 10 11 12 Letter N O P QR S T U V W X Y Z Key 13 1415 16 17 18 19 2021 22 23 242:5 (a) (5 points) Give the contents of the hash table that results when the following keys are inserted in that order into an initially empty 13-item hash table: (Ei, A. Si, yQ.U.,,S, T, 1,O.M). Use h(k) = k mod 13 for the hash function for the k-th letter of the alphabet (see above table for converting letter keys to integer values). Use linear probing. b) (5 points) Give the contents of the hash table that results when the same keys are inserted in that order into an initially empty 13-item hash table. Use h (k) = k mod 13 for the hash function for the k-th letter of the alphabet (see above table for converting letter keys to integer values). Use double hashing and let h'(k)-1+(k mod 11) be the secondary hash function