anchor.diff:          (append y (pluck x)) ; if it is, add it to the return list
           (append y (collect-atoms (car x) nil)))))) ; if it's not, search within it for atoms
   
  -
  +;;; ----------
   ;;; Question 3
   
   ; Solution uses recursion with 2 base cases, one for either input list being
  
positive.code: 
  |#
  
  ;;; Question 1
  
  ; Solution tests y against each element of x until a match
  
negative.code: (defun split-into (L R)
    "Appends elements of list L alternatingly to the two sublists in list R"
  
    (if
      ;; Base Cases
      (null L) R ; input list is empty
  
      ;; Recursion
      (split-into ; expects L and R
        (cddr L) ; discard the first two elements of L
        (list ; but first capture them into R[0] and R[1] respectively
          (append (car R) (pluck L)) ; add L[0] to R[0]
          (append (cadr R) (pluck (cdr L))))))) ; add L[1] to R[1]
  