anchor.diff:  
   
   ;;
  -;; Quesstion
  +;; Question
   ;;
   ;; You can represent a table in lisp by making each row a list and collecting all the rows in a list. E.g. a table like,
   ;;
  
positive.code:     (powerr x (- y 1) (* x pro))))
  
  ;;
  ;; Question
  ;;
  ;; Compute the average of two integers m and n (where m < n)  
  
negative.code:   (if (>= (length seqA) (length seqB))
        seqA
        seqB))
  
  (defun longest-chain (seq &optional prev chain backup)
    (cond ((endp seq) (if (null backup)
  