This is in the programming language Scheme.

Consider an implementation of sets with Scheme lists. A set is an unordered collection of elements, without duplicates. (a) Write a recursive function (is-set? L), which determines whether the list L is a set. The following examples illustrate the use of this function: > (is-set?' (1 2 5)) #t > (is-set?' (1 5 2 5)) #f (b) Write a recursive function (make - set L), which returns a set built from list L by removing duplicates, if any. Remember that the order of set elements does not matter. The following example illustrates the use of this function: > (make-set' (4 3 5 3 4 1)) (5 3 4 1) (c) Write a recursive function (subset? A S), which determines whether the set A is a subset of the set S. (d) Write a recursive function (union A B), which returns the union of sets A and B. (e) Write a recursive function (intersection A B), which returns the intersection of sets A and B. Consider an implementation of sets with Scheme lists. A set is an unordered collection of elements, without duplicates. (a) Write a recursive function (is-set? L), which determines whether the list L is a set. The following examples illustrate the use of this function: > (is-set?' (1 2 5)) #t > (is-set?' (1 5 2 5)) #f (b) Write a recursive function (make - set L), which returns a set built from list L by removing duplicates, if any. Remember that the order of set elements does not matter. The following example illustrates the use of this function: > (make-set' (4 3 5 3 4 1)) (5 3 4 1) (c) Write a recursive function (subset? A S), which determines whether the set A is a subset of the set S. (d) Write a recursive function (union A B), which returns the union of sets A and B. (e) Write a recursive function (intersection A B), which returns the intersection of sets A and B