Programmings›Algorithm Cookbook›Chapter 6. Sorting6.21 Lower Bounds for SortingProve that any comparison-based sorting algorithm requires Ω(n log n) comparisons in the worst case using a decision tree argument.