5. Consider uning the linear selection algorithm on an array with n unique elements. What is a tight lower bound on the number of elements less than the median of medians? Assume the median of medians is found with groups of seven and that there are an odd number of groups. (A) 35+2 (B) 11 +3 (C) 3 2 (D) 11 +2 (E) 2 (F) 2n125 (G) 3 + 3 (H) 3 +3 6. Consider running the linear selection algorithm on an array with nunique elements. What is a reasonable recurrence equation to describe the running time of the algorithm? Assume the median of medians is found with groups of seven. (A) T(n) = T() + T(1 (B) T(n) = T(#) + r (C) T(n) = T(#) + T( (D) T(n) = T() + T( P) + (n) ) + (n) ) + (n) ) + (n) (F) T(n) = T() + T(P) + (n) 7. Consider running the linear selection algorithin on an array with n = 3k unique elements. what is a reasonable recurrence equation to describe the running time of the algorithm? Assume the median of medians is found with groups of three. (A) T(n) = T() + T ) + (n) (B) T(n) = T() + T ) + (n) (C) T(n) = T(3) + T(3) + (n) (E) T(n) = T() + T(#) + (n) (F) T(n) = T() + T(F) + (n) 8. Consider running the linear selection algorithm on an array with n = 5k unique elements. what is a reasonable recurrence equation to describe the running time of the algorithm? Assume the median of medians is found with groups of five. (B) T(n) = T() + T() + (n) (C) T(n) = T(#) + r ) + (n)