Write the following functions in Scheme/DrRacket:

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 The remove-if function returns a list with all elements in 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 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 The remove-if function returns a list with all elements in 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