In the worst case, this function is the tight asymptotic lower bound of the median of medians algori
In the worst case, this function is the tight asymptotic lower bound of the median of medians algorithmto select the kth largest element. For a word size of k, the worst case performance of radix sort is big O ofk times this function with respect to the elements being sorted. Searching an unbalanced binary searchtree has a worst case runtime tightly bounded by this function. This function is the best case timecomplexity of (*) bubble sort. Algorithms that traverse from the first to last element in a singly linked list withouta tail pointer and ones that iterate through a one-dimensional array in a for loop are bounded by this function. For10 points, name this function that dominates algorithms that run in Big O of n time.