Create a recursive procedure called alternate lst1 Ist2 Ist3

Create a recursive procedure called (alternate lst1 Ist2 Ist3) that returns a list with alternative values from the 3 given list. Use comments to indicate in the code the four steps of the fantastic approach. Assume that all 3 lists have the same length. Test case: (alternate \'(1 2 3) \'(a b c) \'(m n o)) should give \'(1 a m 2 b n 3 c o). Create a recursive procedure called (pairs Ist1 Ist2) that returns a list of pairs from 2 given lists. Use comments to indicate in the code the four steps of the fantastic approach. You can assume that the both lists have the same length. Test case: (pairs \'(1 2 3) \'(a b c)) should give \'((1. a) (2. b) (3. c)).

Solution

(2).

(3).