(10%) Given a sequence of $n$ numbers, what is the lower bound for sorting algorithms employing comparison and exchange operations?