How does the Hashmap store data if 2 keys have same hash values? How does hashmap ensure that the hash code of 2 keys is never same