Can Consistent Hashing alone solve the 'Celebrity Problem' (one key getting 1M req/sec)?

1. A Yes, standard consistent hashing algorithms automatically detect hot keys and spread them across all available cluster nodes.
2. B Yes, the use of Virtual Nodes ensures that any individual key is physically replicated and load-balanced across the entire ring.
3. C No, it maps a key to exactly one set of nodes; if a single specific key receives extreme traffic, it can still overwhelm those specific servers.
4. D Yes, by simply increasing the replication factor until every node in the cluster holds a copy of the high-traffic 'celebrity' record.