Write a recursive function (union A B), which returns the union of sets A and B. code example

Example: scheme union of two lists

(define (union a b)
  (cond ((null? b) a)
        ((member (car b) a)
         (union a (cdr b)))
        (else (union (cons (car b) a) (cdr b)))))

(union '(1 2 3) '(2 4 2))