[plt-scheme] algorithm qn (newbie)

I'm working thru The Little Lisper, 2nd Ed.  Exercise
6.5 (p115) asks:  Can one can change

(define member* 
  (lambda (a l)
  (cond
    [(null? l) #f]
    [(atom? (car l)) (or (eq? (car l) a)
                         (member* a (cdr l)))]
    [#t (or (member* a (car l))
           (member* a (cdr l)))])))

so that query

(member* 
   'chips 
   '((potato) (chips ((with) fish) (chips))))

finds the last chips first?

Would that be a yes or would that be a no?  

(This is not assigned homework.)

thx,
George Herson