Define a SCHEME function, merge, which takes two lists `1 and `2 as arguments. Assuming that each of `1 and `2 are sorted lists of integers (in increasing order, say), merge must return the sorted list containing all elements of `1 and `2 . To carry out the merge, observe that since `1 and `2 are already sorted, it is easy to find the smallest element among all those in `1 and `2 : it is simply the smaller of the first elements of `1 and `2 . Removing this smallest element from whichever of the two lists it came from, we can recurse on the resulting two lists (which are still sorted), and place this smallest element at the beginning of the result