Assume that we use Quicksort (as in the textbook) to sort the array A with 5 ele- ments where the initial values of the array elements (from A[1] to A[5]) are A: 19 16 13 25 22 This question tests your understanding of the algorithm by following the element-wise com- parisons made in the execution of the algorithm. 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 (Line 4 in Partition). 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 1922? On the answer sheet, answer the following questions by checking the corresponding box. (a) What is the 2nd element-wise comparison? (b) What is the 4th element-wise comparison? (c) What is the 6th element-wise comparison? (d) What is the 7th element-wise comparison? In order to answer the above questions correctly, you need to execute the algorithm on the given input step by step.