Please provide the solution/code for the following screenshot. The language is used is Racket and please make sure to provide the definitions of all the functions. Please use recursion and set...

Please provide the solution/code for the following screenshot. The language is used is
Racket
and please make sure to provide the definitions of all the functions. Please use
recursion and set operation.

Extracted text: For this question, for simplicity you may assume that a set contains only atomic values (numbers, string, symbols, etc. but not sets or lists) and it does not contain duplicate members. Two common operations on sets are union and intersection. The union of two sets is the set of all elements that appear in either set (with no repetitions). The intersection of two sets is the set of elements that appear in both sets. Write Racket functions (union Si S2) and (intersect S1 S2) that implement set union and set intersection. Test cases: (union '(1 2 3) '(3 2 1)) (1 2 3) ---> (union '(1 2 3) '(3 4 5)) ---> (1 2 3 4 5) (union '(a b c) '(3 2 1)) (a bc 1 2 3) ---> (intersect '(1 2 3) '(3 2 1)) ---> (1 2 3) (intersect '(1 2 3) '(4 5 6)) ---> () (intersect '(1 2 3) '(2 3 4 5 6)) ---> (2 3) The ordering of the elements in your answer may differ from the above.