When would you choose a BRIN (Block Range Index) over a B-Tree for a Timestamp column?

1. A When the table is exceptionally large, naturally sorted by the indexed column, and you require an index that is thousands of times smaller than a B-Tree.
2. B When you need to enforce a strictly 'Unique' constraint across several disparate database partitions while maintaining millisecond-level lookup speed.
3. C When the dataset suffers from frequent, random primary key updates that would otherwise cause massive fragmentation in a standard B-Tree structure.
4. D When you require absolute millisecond-level precision for point-lookups on columns with high cardinality and a random distribution of values.