(3) Let p = 7, m = 4, and consider the keys 1,2, 5, 6. See if you can find a per- fect hash of these keys with two-level storage where the secondary storage takes up tables whose sizes sum to no more than 8, following the method described in class and using hash functions from {hab} for the appropriately chosen a and b. Draw a picture of your two level hash table with the keys filled in and say exactly which hash functions you used for the main table and the secondary tables specified. (page 264 in text) Consider a hash table of size m = 1000 and a hash function h(k) = [m(kA mod 1)] for A = .618. Compute the locations to which the keys 61, 62, and 63 are mapped. (You can use a calculator.) (Note that x mod 1 means taking the fractional part of x). (3) Let p = 7, m = 4, and consider the keys 1,2, 5, 6. See if you can find a per- fect hash of these keys with two-level storage where the secondary storage takes up tables whose sizes sum to no more than 8, following the method described in class and using hash functions from {hab} for the appropriately chosen a and b. Draw a picture of your two level hash table with the keys filled in and say exactly which hash functions you used for the main table and the secondary tables specified. (page 264 in text) Consider a hash table of size m = 1000 and a hash function h(k) = [m(kA mod 1)] for A = .618. Compute the locations to which the keys 61, 62, and 63 are mapped. (You can use a calculator.) (Note that x mod 1 means taking the fractional part of x)