Write a Scheme function that takes two atoms and a list as parameters and replaces all occurrences of the first given atom in the list with the second given atom, no matter how deeply the first atom is nested.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.