Assuming keys are comprised of upper- and lowercase letters, give the bit pattern and base 10 numeric value of the pseudo key that would result from processing the key Mary using the algorithm illustrated in Figure 5.17 .

Pseudo keys are in the range 0 to 200,000 and a maximum of 9000 nodes will be stored in a nonperfect hashed data structure. Give the size of the primary storage area array (number of elements) that will produce the optimum loading factor.