Scheme Create a recursive procedure called pairs lst1 lst2

Scheme - Create a recursive procedure called (pairs lst1 lst2) that returns a list of pairs from 2 given lists.

Test case: (pairs ‘(1 2 3) ‘(a b c)) should give \'((1 . a) (2 . b) (3 . c)).

Solution

(define (pairs lst1 lst2) (cond [(empty? lst1) empty] [(empty? lst2) empty] [else (cons (lst (first lst1) (first lst2)) (comb (rest lst1) (rest lst2)))]))