Consider all versions of select(A, k) that splits A into arrays of q elements where q 3, 4, 5, 6,7, 8, .. Which value of q do you think makes the algorithm fastest? Find the number of comparisons as the speed index for each q as accurate as you can. You can assume that the selection algorithm uses the selection sort to sort each array of q elements. (We learned selection sort in the first class.)