2. (20 points) In the median finding algorithm, in the first step, the procedure splits the given array into collections of size 5. Consider the same algorithm, except that we split the array into collections of size 7. What will be the running time of the algorithm? For your convenience, here is the pseudo-code of the algorithm from the lecture: SELECT(A,K) 1. Let n be the size of the array A. If n k, then return SELECT(A[1,....),k). 9. else if i