How are hash tables values stored physically in memory? For example, hash values of 0, 5, and 10 are uniformly distributed, but when inserted into a hash table of potential size 5, they all collide in bucket 0 It would be better to say the should be uniformly distributed, not the hash itself