Suppose we want to choose a sorting algorithm with the best worst-case running time possible for the assumed input below. What sorting algorithm would you use? What would the running time of the algorithm be? Justify your answer. a) A list of n local phone numbers. b) An array of n grades from 0 to 100. c) An array of n numbers, all of which are a power of 2