Sorting and Selection 1) Answer the following quest ions about QuickSort a, What are two worst-case inputs for the version which partitions a round the last element in each (subjarray (2 points)? b. Briefly explain why these inputs maximize the runtime c. Under which conditions does QuickSort achieve e(n logn) runtime even in the worst-case (2 points)? Name an algorithm that can be used to ensure this condition is met and the e(n log n) runtime is achieved d. e. Explain why this approach is not used in practice despite the theoretical improvement