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. +)'((23) (8 ((apply-function "* returns '6 14) +)'((5 7) (2 3) (33)) ((apply-function "* returns '(12 69) (hint: write the recursive function transform: (transform fg l) and call it in the lambda function: