D. We proved that every algorithm that sorts n things using comparisons must use at least log₂(n!) comparisons in the worst case. log₂(n!) is very close to n log₂(n).