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. Write a Racket...

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. Write a Racket function (member? x L) that tests whether x E L where L is a set (represented as a list). (Hint: x E Lif and only if either x is equal to the head of L, or x is in the remainder of L.) Test cases: (member? 1 '(3 2 1)) ---> #t (member? 4 '(3 2 1)) ---> #f (member? 1 'Q)---> #f (member? 'susan '(susan john ryan)) - --> #t