What happens to a B-Tree index over time as you delete and update many rows?

1. A It becomes fragmented (leaf page bloat), potentially requiring a `REINDEX` or `VACUUM` to reclaim physical disk space and restore performance.
2. B It implements a transparent, high-speed auto-compression routine that perfectly collapses all empty storage gaps without any external intervention.
3. C It automatically converts itself into a Hash Index once a specific threshold of record deletions is reached to ensure that point-lookups remain O(1).
4. D Nothing significant; B-Tree indexes are designed to be mathematically self-healing and maintain absolute efficiency regardless of the volume of updates.