Question

A cost-based optimizer must pick between two access paths for a selection. You are given table_rows (int row count), a 'selectivity' float in [0,1] (fraction of rows matching the predicate), and a 'has_index' bool. The full scan costs table_rows (one unit per row read). The index path, available only if has_index is true, costs 3 (index descent) plus 5 * (matched rows), where matched rows = round(table_rows * selectivity) using Python's round. Return the string 'index' if the index path exists and its cost is strictly less than the scan cost, otherwise 'scan'. Also return the chosen cost. Return [choice, cost].