Write a hashCode method for a Hashtable. (For some reason, you’ll be hashing hash tables into other hash tables!) Must the hashing mechanism look at the value of every element? Since URLs differ...

Write a hashCode method for a Hashtable. (For some reason, you’ll be hashing hash tables into other hash tables!) Must the hashing mechanism look at the value of every element?

Since URLs differ mostly toward their end (at high indices), write code that efficiently computes a hash code based on characters l − xi where xi = 2 i and i = 0, 1, 2, . . . How fast does this algorithm run? Is it better able to distinguish different URLs?