- Recursive strategy when the input L is still reducible in size: - Find the largest number in the input list, L. Use Python's built-in max function to do this. - Remove the largest number. Use Python's remove method of lists to do this. - After you remove the largest, L has one item fewer, i.e. you've "reduced" the input size of L. - Use "the same recursive strategy" to get a sorted list of the remaining numbers in L. - Assemble the largest number and the sorted list of the remaining numbers to construct a sorted list of L Write down the running time equation, T(n), of the recursive strategy in Problem 7