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 isRacket
and please make sure to provide the definitions of all the functions and the function itself. 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 (set-equal? L1 L2) that tests whether L1 and L2 are equal. Two sets are equal if they contain exactly the same members, ignoring ordering (or in other --------------------------------------- words, two sets are equal if they are a subset of each other). For example (set-equal? '(1 2 3) '(3 2 1)) ---> #t (set-equal? '(1 2) '(3 2 1)) ---> #f (set-equal? '(ryan susan john) '(susan john ryan)) ---> #t w nn w.