QUESTI 0.5 points Save Answer Let n be a nonnegative integer. Then O(n) O(nlog2n). O True O False QUESTI 0.5 points Save Answer Let L be a list of n distinct elements. Any sorting algorithm that sorts L by comparison of the keys only, in its worst case, makes at least O(nlog2n) key comparisons. O True O False QUESTI 0.5 points Save Answer The merge sort algorithm partitions a list into two sublists such that the number of elements in the first sublist is less than the number of elements in the second sublist. O True O False