Both of these are to be done in Scheme.

a.) Define a function sort which accepts only a list of numbers as an argument and returns the list of numbers sorted in increasing order.

b.) Define a function sort which accepts only a numeric comparison predicate and a list of numbers as arguments, in that order, and returns the list of numbers sorted by the predicate.

1 sort 0) 2 4 sort (3)) 5 (3) 7 sort (3 2) 8 (2 3) 10 sort (3 2 1)) 11 (1 2 3) 13 sort (9 8 7 6 5 4 3 2 1) 14 (1 2 3 4 5 6 7 8 9)