Standard Consistent Hashing maps keys to nodes but ignores current load (CPU/Requests). How does 'Consistent Hashing with Bounded Loads' (Google) address the Hot Spot problem?

1. A If a target node is overloaded (load > c * average), the algorithm spills over the request to the next available node in the ring.
2. B It immediately drops the request and sends a '503 Service Unavailable' signal back to the client to protect the cluster's health.
3. C It triggers an automated serverless function that dynamically provisions additional virtual hardware resources to the hot node.
4. D It forces a cryptographic change in the primary hash function to redistribute the hot key across an entirely different set of nodes.