It's a LISP Programming problem please help me!

I need to make reflect function!

This is the question......

replace word by word in the list using substitution list(shallow recursion)

(reflect '((I U)(U me)) '(I love U)) => (U love me)

(reflect '((ugly handsome)(is was)(fool genius))

'(Tom thinks he is a fool)) => (Tom thinks he was a genius)

Hint: build a function (reflect-atom x l)

if table = ((i u)(you me))

then

(reflect i table) = u

(reflect want table) = want