Question: 1. (13 pts) Write a recursive Scheme function (subst x y L), which returns a list identical to L except that every occurrence of x

1. (13 pts) Write a recursive Scheme function (subst x y L), which returns a list identical to L except that every occurrence of x has been replaced with y. The following example illustrates the use of this function: >(subst 'c 'k ,(cconut)) (k okonu t)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
