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(subset? L1 L2) that tests whether Li C L2. L1 is a subset of L2 if every element of Li is also a member of L2. Test cases: (subset? '(1 2 3) '(3 2 1))---> #t (subset? '(1 2 3) '(4 5 6)) ---> #f (subset? '(1 2 3) '(1 2 3 4 5 6)) ---> #t (subset? '(1 2) '())---> #f