Recаll the Rаndоmized Quicksоrt аlgоrithm to sort a list of n elements: randomly choose an element p from the list to be the pivot, compare p with all other elements to create the lists L of all element < p, M of all elements = p, and R of all elements > p, recursively sort L and R, and then return the sorted list. If the list input to Randomized Quicksort is already sorted, then how much time will the algorithm take to terminate?