The worst-case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

• A. Θ (n log n), Θ (n log n), and Θ (n2)
• B. Θ (n2), Θ (n2), and Θ (n log n)
• C. Θ (n2), Θ (n log n), and Θ (n log n)
• D. Θ (n2), Θ (n log n), and Θ (n2)