Selection Problem Input: A set A of n (distint numbers and an integer i where 1 sin Output: the i-th smallest element of A Consider the following input array: 9,3, 6, 7, 10, 8, 2,5, 1, 4] and the number 7 as input to the selection problem. Using QuickSelect, let us assume that the first pivot found is 4. This means, QuickSelect has to be called again on a subarray of A. What will be the value of number i upon the next call to QuickSelect? Select one: 4 6