anchor.diff:        'DONE
         (and (print (type? (car lst))) (types (cdr lst)))))
   
  -;; 
  -;; Question
  -;; 
  -;;  Define a procedure SEARCH-POS that takes a list as search item, another list as a
  -;;  search list and returns the list of positions that the search item is found in the search
  -;;  list. Positioning starts with 0. A sample interaction:
  -;;
  -;;  * (search-pos '(a b) '(a b c d a b a b))
  -;;  (6 4 0)
  -;;
  -;;  * (search-pos '(a a) '(a a a a b a b))
  -;;  (2 1 0)
  -;; 
  -
  -(defun search-s (x lst &optional store (pos 0))
  -  (if (endp lst)
  -      (reverse store)
  -      (search-pos
  -        x
  -        (cdr lst)
  -        (if (equal (car lst) x)
  -            (cons pos store)
  -            store)
  -        (+ pos 1))))
  -
  -
   
   ;; 
   ;; Question
  
positive.code: 
  (defun search-pos (search-item search-list)
    "return the list of positions search-item (a list) matches in search-list"
    (let ((win (make-list(length search-item)))
  		(store nil))
  	(dotimes (i (length search-list) store)
  	  (setf win (append
  
negative.code:       (and (print (random 2)) (toss (- n 1)))))
  
  
  
  
  
  
  
  
  ;; 
  ;; Question
  ;; 
  