Write in Scheme.

Solve this problem using the programming language calledScheme.

3. Write a recursive program in Scheme (apply-function fg) that returns a new lambda function that takes a List parameter L that contains pairs of elements (a b) and returns a new List by applying the following on every element of L: f(a b) if a <5 and g(a b) otherwise. +) ‘((2 3) (8 6))) ((apply-function “* Returns (6 14) ((apply-function ‘* ‘+)'((57) (2 3) (33)) Returns (12 6 9) (Hint: write the recursive function transform: (transform fg L) and call it in the lambda function: Show transcribed image text 3. Write a recursive program in Scheme (apply-function fg) that returns a new lambda function that takes a List parameter L that contains pairs of elements (a b) and returns a new List by applying the following on every element of L: f(a b) if a

## Expert Answer

Answer to Write in Scheme. Solve this problem using the programming language called Scheme….