Which of the following descriptions of pivot selection will result in the best case quicksort runtime? O Randomly choosing the pivot O Choosing the first value as the pivot O Choosing the median index as the pivot O Choosing the median value as the pivot There is no definite pivot selection method that will always result in best case runtime Consider the merge sort from class. How many times will the element at index O be copied when sorting an array of length n over the entire run of the algorithm? O 1 Olg(n) O 2*lg(n) O n/2 On Which of the following statements about sorting are true? The best case time of all sorts is O(1) because of the case when an array is length 1 Merge sort has best and worst cases of O(nlg(n)) If arrays are split into thirds instead of halves in merge sort, the best case would still be Onlg(n)) (HINT: look up the rules of logs!) Quicksort is O(n^2) only when an array is in reversed order The worst cases for selection sort and insertion sort occur when an array is in reversed order