> This problem is paper-only - see explanation for the canonical SQL solution.
Given `Customers(id, total_spend)`, bucket customers into **quartiles by total_spend ascending** using `NTILE(4)`. Lower spend gets quartile 1; higher spend gets quartile 4.
Tiebreak by id ascending. Return `[{ id, total_spend, quartile }]` sorted by quartile ascending, total_spend ascending, id ascending.
**For the auto-grader:** implement `assignQuartiles(customers)`.