USING scheme

USING scheme

1. (3 points) Write a Scheme remove-if function. It takes two argu- ments. The first is a boolean function f, and the second is a list l The remove-if function returns a list with all elements a in l such that f(x)-#t being removed. For example, (remove-if (lambda (x) (>x 3))(10 1 7 2)) should return the list (1 2), since both 10 and 7 are greater than 3 Define the remove-if function by using case analysis and recursion