Hello please complete and run the following question using t

Hello, please complete and run the following question using the Dr.Racket program.

Implement a Scheme function, pair, that takes two lists L and M. and returns a list in which each element is a pair of corresponding elements. For example, (pair \'(fee fi) \' (fo fum)) returns \'((fee fo) (fi fum)). The two lists are required to have the same length. If not. return #f. If both lists are empty, return an empty list.

Solution

(define (union a b)
(cond ((null? b) a)
((element? (car b) a)
(union a (cdr b)))
(#t (union (cons (car b) a) (cdr b)))))
      
(define (pair2 a b)
(list (union a b)))