1(a) ( mergelists '(2 3 4) '(1 4) ) = (1 2 3 4 4)

1(b) ( sortlist '(1 7 3 5 3) ) = (1 3 3 5 7)

1(c) ( dup '(1 3 5 3) ) = t

2(a) ( count '( (1 2) (1 3) (1 4) ) ) = 3

2(b) ( duplist_of_lists '( (1 2) (2 3 4) (5 6 8) (1 2)) ) = t

2(c) ( permute '(1 2 3) ) = '((1 2 3) (1 3 2) (2 1 3) (2 3 1) (3 1 2) (3 2 1) )

3(a) ( make_cons_tree '( 1 2 3 4 5) ) = (((1 . 2) . (3 . 4)) . ((5 . nil) . (nil . nil)) )

     ( make_cons_tree '(3 2 1) ) = ((1 . 2) . (3 . nil))

     ( make_cons_tree '(1 4 8 6 2 7 3 9 10 5) ) = 
		      ( (((1 . 2) . (3 . 4)) .  ((5 . 6) . (7 . 8))) . (((9 . 10) . (nil . nil)) . ((nil . nil) . (nil . nil))) )
			      
3(b) ( squeeze '(1 2 3) ) = ((1 . 2) . (3 . nil))

3(c) ( cons_treep '(nil . 3) ) = nil
     ( cons_treep '(3 . nil) ) = nil
     ( cons_treep '((1 . 2) . (3 . 4)) ) = t
     ( cons_treep '( ((((1 . 2) . (3 . 4)) .  ((5 . 6) . (7 . 8))) . ((9 . 10) .  ((nil . nil) . (nil . nil)))) ) ) = nil
3(d) ( bin 6 ) = (1 1 0)


3(e) ( kthleast '((1 . 2) . (5 . nil)) 3 ) = 5
     ( kthleast '( (((1 . 2) . (3 . 4)) .  ((5 . 6) . (7 . 8))) . (((9 . 10) . (nil . nil)) . ((nil . nil) . (nil . nil))) ) 5) = 5