Google's 'Jump Consistent Hash' algorithm is faster and uses less memory than ring-based hashing. What is its critical limitation?

1. A It requires expensive floating-point arithmetic on every key lookup, making it unsuitable for low-latency embedded systems.
2. B It only supports string-based keys and requires a manual internal conversion phase before it can handle standard integer inputs.
3. C It cannot handle the removal of arbitrary nodes; only the last added node (the tail) can be removed without causing a massive reshuffle.
4. D It suffers from O(N) lookup time because it must iterate through every single valid node index for every individual key request.