QUESTION 4 Consider list (4, 2, 7, 3, 5, 13, 11, 8, 6, 2). Suppose we modify the quick sort algorithm so rather than choosing the first element at fromIndex as pivot in the partition) method, we choose the last element element at tolndex as pivot. This requires a change to the quickSort() method: when we make the original call to sort list, we still pass the indices of the first and last elements of list as the arguments to quickSort)-in this example, the call would be quick Sort(list, 0, 9)-but on the subsequent recursive calls, we must pass fromIndex and partitionIndex - 1 as arguments to quickSort)-rather than passing fromIndex and partitionindex as we would when choosing the first element as pivot. We make those changes and then make the original call quickSort(list, 0, 9) to sort list. Since fromIndex is less than toIndex we will call partition(list, 0, 9). After we return from partition)-which returns partitionindex-we recursively call quickSort) twice. The question is: during the first recursive call, what what will be the values of the fromindex and toIndex parameters in quick SortO? fromIndex-0 and toIndex-0 fromIndex-0 and toIndex9 fromIndex 2 and toIndex 2 mindex 2 and toIndex = 4 fromIndexs 0 and toIndex-1 QUESTION S Consider the DList class provided in the Week 6 source code archive which stored int data. A common operation on a Save All Ans