Use strategy in problem 8 to solve 9.

Go through the following strategy to sort this list L=[10,8,20,1,12,7], and answer the questions. - Use the "move" function (defined above) to move [10,8,20,1,12,7] into two smaller lists: "less" and "more". - Question A: What do the two lists "less" and "more" look like? - Sort the numbers in the list "less" using the same strategy recursively. - Question B: What does the result look like when "less" is sorted using the same strategy recursively? - Sort the numbers in the list "more" using the same strategy recursively. - Question C: What does the result look like when "more" is sorted using the same strategy recursively? - Now, you should have everything needed to produce a sorted version of the input list. - Question D: How do you construct the sorted version of L (the input list) based on the results of sorting "less" and "more? Problem 9 Use the strategy in the previous problem to implement the sort function below. Notes: - This program must return a list of sorted numbers. - If the input list has only 1 numbers, it's already sorted, return the same list. - If the input list has more than 1 numbers, use the strategy described in the previous problem. def sort(L): \# your code goes here pass