Answer the following questions about the QuickPick algorithm below. This algorithm returns takes in an array data and a target index i, and it returns the ith smallest element of data. Input: data: an array of n integers Input: n: the size of data Input: i: an integer in the range 1-n Output: the ith smallest element of data 1 Algorithm: QuickPick 2 Let pivot be a random element of data 3 Partition data as in QuickSort, with all elements to its left