Answer TRUE or FALSE.
The lower bound of the sorting problem is O(n \log n)
because we can prove that this is the best cost that any sorting
algorithm could reach.
This comes straight from the definition of a problem lower bound.