When walking the ring to find 3 replicas, standard Consistent Hashing might pick 3 nodes in the same Rack. How is Rack Awareness typically implemented in the Ring walk?

1. A The ring walk continues clockwise but skips any node that belongs to a Rack ID already present in the current replica preference list.
2. B The system initializes a separate, dedicated hash ring for each physical rack to ensure that data never leaves its localized failure domain.
3. C The nodes are pre-sorted by Rack ID before being hashed to ensure that no two adjacent points on the ring can ever share a rack.
4. D It relies on the mathematical probability that random placement will naturally spread replicas across different physical racks at scale.