What are the main conditions to consider when choosing a key for a hash table?

When choosing a key for a hash table in Python, it is important to consider the following conditions:

• Hashability: The key must be an immutable object, such as strings, numbers, or tuples with immutable elements. This is necessary to ensure that the hash value of the key remains constant.

• Proper implementation of __hash__ and __eq__ methods: Objects should correctly implement these methods so that the hash table can properly compare keys and distribute them across buckets.

• Hash distribution: It is desirable for the hash function to distribute keys evenly to avoid collisions and improve performance.

Example of using a key in a dictionary:

key = (1, 'a')  # tuple — hashable key
my_dict = {key: 'value'}