provide screenshot

In this assignment you will do some programming in Scheme to get an idea about what it is like to program in a functional programming language. The programming task to be completed is to implement sets as lists and write functions for various set operations, for example, membership, union, intersection, etc. To keep things simple, we restrict the objects in the sets to symbolic atoms e.g. a, b, d23, etc. The operations are specified as under. As an example, the definition of the first function is given. 1. member (x, set ) : returns true if x is a member of set S, otherwise false. Example: member ('a ' (abb c) ) true (define (member x set) (cond ( (nul1? set) \#F ) ( (equal? x (car set)) \#T) ( else (member x (cdr set))) 2. subset (set1, set 2 ) : returns true if set1 is a subset of set2, otherwise false. Examples: subset(' (ab) ' (accbc) true subset("(a b) '( (a c d) ) false 3. union (set1, set 2 ) : returns a set that is union of sets set1 and set2. Example: union (' (a b) '(a d)) (a b c d) 4. intersection (set1, set2) : returns a set that is intersection of sets set 1 and set 2 , Example: intersection (' (a b c c) '( acd) ) (a c c) 5. difference (set1, set 2 ) : returns a set that is the set difference of set1 and set2, that is, the elements of set2 2 are removed from set1. Example: difference(' (a b c) '( (ac)) (b) 6. Submission - Submit all .rkt files