anchor.diff:  					(list (cdr L))
   				)
   			)
  -			
  +
   			(t (cons 
   				(cons 
   					(car L)
  
positive.code: 	(split '(1 2 3 4 5 6)) --> ((1 3 5) (2 4 6))
  	(split '((a) (b c) (d e f) g h)) --> ((a) (d e f) f) ((b c) g))
  	(split '()) --> (nil nil) 
  |#
  
  	(defun split (L)
  
negative.code: 		return add to output list + flatten(send rest of list, excluding first element X
  	else
  		return (append (flatten(first element) + flatten(rest of elements))) if the whole list is a nested list send it all to be broken down
  |#
  
  	(defun flatten (X)
  