(2) Consider inserting the keys 8,5, 14 into a hash table of length m 8 with the hash function h(km(kA-[kA])] where A 0.625 (a) (2 points) Illustrate the result of inserting these keys. b) (1 point) Now compute the hash function of the key 14 using the implementation we described in our notes. You can assume we have a word size w4. Since m8 p 3. Since A 0.625 10/2-10/2", s-10. 23 Hint: Compute ks and convert it to a binary number. This num- ber will consist of S2w bits. Look at the rightmost w bits. Of those bits, convert the leftmost p bits back to an integer. This integer is your hash table slot.)