Answer TRUE or FALSE.
The worst case upper bound for sorting an array
is O(n \log n) since this is the cost of the best
algorithm (in the worst case) that we know about.
This comes straight from the definition for problem upper bound.