Concept: linear selection 12. Consider running the linear selection algorithm on an array of n unique elements. How many elements are on the large side of the patition in the worst case? Assume the median of medians is found with groups of seven. (A) 417 (B) 10n 28 (C) 414 (DS (E) none of the other answers are correct 13. Consider running the linear selection algorithm on an array of n unique elements. What is the number of elements that of seven. are guaranteed to be greater than the median of medians? Assume the median of medians is found with groups (A) (B) 10n 28 (C) TT (D) (E) none of the other answers are correct (F) 4n4 14. Consider running the linear selection algorithm on an array with n 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 seventeen and that all numbers divide evenly (A) none of the other answers are correct (D) T(n) = T()-T() + (n) 15. Consider running the linear selection algorithm on an array with 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. (C) T(n) = T(F) + T(5) +0(n) 16. As the size of the groups in the linear selection algorithm increases, the ratio of the "large" side of the partition to the "small" side of the partition grows (A) stays the same (B) smaller (C) larger