Define a recursive LISP function named replace which takes two arguments, $s$ as a symbol and $L$ as a list. For every occurrence of $s$ found in $L,$ replaces it by symbol red.

e$.$g$.($modify

$\text{'}$c

$\text{'}($a

b

c

d

c

e$))$ returns

$($a

b

red

d

red

e$)$