14. Consider an array of size n with perfectly inversely sorted order. Which of the following is correct about the running times to sort this array (deterministically)? (A) Quicksort: O(n ign)； Merge Sort: O(n ign)； Insertion Sort: O(n2) (B) Quicksort: 0(n2)； Merge Sort: O(n2)； Insertion Sort: 0(n2) (C) Quicksort: O(n2)； Merge Sort: O(n lgn)； Insertion Sort: O(n lgn) (D) Quicksort: 0(n2)； Merge Sort: O(n lgn)； Insertion Sort: O(n2)