Consider Selection Sort for an array of five elements: [5,4, 3, 2,1). In the worst case, the total number of comparisons needed to sort this array is , and the total number of assignments is , remembering that a swap requires three assignments. D Question 4 2 pts We studied three O(n log n) sorting algorithms. Typically, these faster algorithms use a "Divide and Conquer" strategy, where: the problem is divided into smaller pieces the smaller pieces are processed recursively the solutions to the smaller pieces are combined Which Oin log n) sorting strategy does the bulk of the work in the divide step? Which O(n log n) sorting strategy does the bulk of the work in the combine step? Do all three of the O(n log n) strategies use a recursive divide-and-conquer approach