vi) Runtime of sorting a set of data using Quick Sort will be highest (or worst) for which set of data? a) 20, 15, 10, 5, 4, 3, 2, 1 b) 1,2, 3, 4, 5, 10, 15, 20 c) 10, 5, 15, 3, 2, 20, 4, d) Either a or b viii) Worst case runtime of searching a set of N number of sorted data using binary search algorithm is: b)
OR
OR