Name two divide and conquer sorting algorithms.

Name three well-known quadratic time sorting algorithms.

In the comparison model of computation, the number of comparisons
any sorting algorithm must make to sort n items is, in the worst case,
at least what?