In this question we will dene a function for sorting lists based upon the algorithm selection sort. First, dene a function smallest which takes as input a list of integers and returns the smallest element in the list;
Next, dene a function delete which takes as input an integer and a list of integers and returns the list obtained by deleting the rst occurence of the integer in the list;
Finally, dene the function select which takes a list of integers and returns the list whose head is the smallest element in the list and whose tail is the result of recursively sorting the list obtained by deleting the smallest element of the list from the list