anchor.diff:  		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)
  
positive.code: 					(list (cdr L))
  				)
  			)
  			
  			(t (cons 
  				(cons 
  					(car L)
  
negative.code: 		return L2
  	else 
  		append (first element in L1 & first element in L2)	combine first element in L1 and first element in L2
  		mix (rest element in L1 & rest element in l2)	send the rest of element in L1 and rest of elements in L2 in recursion
  |#
  
  	(defun mix (L1 L2)
  