I am looking for CLISP! NOT Racket, NOT Python. If it is anything other than CLISP it will be down voted.

Define a function that takes two lists as arguments and returns a single list of pairs (i.e, two element sublists). The first pair should both be the first elements from the respective lists The second pair should be the second elements from the respective lists, and so on. If one input list is longer than the other, extra elements of the longer list are ignored. Your lementation must be recursive Input: Two Lists of elements of any type, potentially heterogenous. The two lists do not have to be the same length. Output: A new list whose elements are each two-element sublists. Examples: (zipper (1 234) (a b cd) ((1 a) (2 b) (3 c) (4 d) >(zipper (1 2 3) (49 57)) (1 4) (2 9) (35) >(zipper '(5) '())