Understand why a range predicate stops the optimizer from using later columns of a composite index as seek keys.
A table has a composite B-tree index on (status, created_at, customer_id). A query runs: WHERE status = 'active' AND created_at > '2024-01-01' AND customer_id = 42. Assuming the optimizer chooses this index, how are the three predicates most likely applied?