s) Let A be an array of 5 integers, whose contents are as follows: 9, 6, 3, 15, 12 We will apply quick sort to sort this array. Show all of the element-wise comparisons made by the algorithm in the correct order. Here an element-wise comparison means the comparison of one element of the array with another element of the array or the key set in a particular step of the algorithm. Since the algorithm may move the elements of the array, you need to show the values of the elements being compared (rather than the form of A[i]). The first element-wise comparison is 9 3 12? You should start with this element-wise comparison to write out all element-wise comparisons, one comparison per row. s) Let A be an array of 5 integers, whose contents are as follows: 9, 6, 3, 15, 12 We will apply quick sort to sort this array. Show all of the element-wise comparisons made by the algorithm in the correct order. Here an element-wise comparison means the comparison of one element of the array with another element of the array or the key set in a particular step of the algorithm. Since the algorithm may move the elements of the array, you need to show the values of the elements being compared (rather than the form of A[i]). The first element-wise comparison is 9 3 12? You should start with this element-wise comparison to write out all element-wise comparisons, one comparison per row