Hash size: Are prime numbers near powers of two a poor choice for the . . . For example, suppose we wish to allocate a hash table, with collisions resolved by chaining, to hold roughly n = 2000 n = 2000 character strings, where a character has 8 bits We don't mind examining an average of 3 elements in an unsuccesful search, so we allocate a table of size m = 701 m = 701