LSM Trees mitigate slow reads by using Bloom Filters. What specific role do they play?

1. A They implement a high-speed, lossy compression routine that automatically collapses all redundant data blocks before they reach the persistent storage layer.
2. B They provide a fast, memory-resident probabilistic check that can instantly determine if a specific key is definitely NOT present within a physical data file.
3. C They act as a primary index for range-based query predicates, allowing the database to prune individual records without performing a B-Tree traversal.
4. D They ensure strict data integrity by preventing the accidental insertion of duplicate primary keys across different levels of the LSM tree structure.