A hash table stores 32-bit integer keys n using the hash function n % M, where M is an odd prime number. Prove that for each bit position in the key, the two keys that differ only in that bit position will have different hash values.