Take every letter of "remarked" and put it into a hash table of size 2 with a load factor of 0.9 using the hash encoding (a - 1, b - 2, c - 3, ... z - 26). a. Show the hash table that results. b. Find the theoretical average number of comparisons to find a letter from a-z (case independent). Assume all letters are equally probable.