**Write in Scheme:**

**DrRacket**

write a recursive program in Scheme (apply-function f g) thatreturns a new lambda function that takes a list parameter L thatcontains pairs of elements (a b) and returns a new lists byapplying the following on every element of L: f(a b) if a < 5and g(a b) otherwise.

Write the recursive function transform: (transform f g L) andcall it in the lambda function

((apply-function ‘* “+)((2 3)(8 6)))

Return ‘(6 14)

((apply-function ‘* ‘+)'((5 7)(2 3)(3 3))

Return ‘(12 6 9

## Expert Answer

Answer to Write in Scheme: DrRacket write a recursive program in Scheme (apply-function f g) that returns a new lambda function th…