Design a program takes as input, X, an unsorted list of numbers, and returns the sorted list of numbers in X. The program must be based on the following strategy: Handle the case when X is empty and has only 1 item. Split X into two lists, using the split function in the previous problem. Sort L and G. Put everything together into a sorted list. Test your program with 10 different unsorted lists.