You may write helper functions and call them in the primary functions. A useful helper function could be to test whether a given sublist /set exists n the given primary list/set. Write a Racket...

Please answer the question in the screenshot. The language used here is in Racket.

Extracted text: You may write helper functions and call them in the primary functions. A useful helper function could be to test whether a given sublist /set exists n the given primary list/set. 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 23) '((3 2)1)) ---> #f (set-equal? '(1 2 3) '((1 2 3))) ---> #f You must use recursion, and not iteration. You may not use side-effects (e.g. set!).