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:

Write a program that performs a simple n-body simulation, called "jumping leprechauns." this simulation involves n leprechauns, numberd 1 to n. it maintains a gold value g_i for each leprechaun i, which begins with each leprechaun starting out with a million dollars worth of gold, that is, g_i = 1000000 for each i = 1,. in addition, the simulation also maintains, for each leprachaun, i, a place on the horizon, which is represented as a double-precision floating point number, x_i. in each iteration of the simulation, the simulation processes the leprachauns in order. processing a leprachaun i during its iteration begins by computing a new place on the horizon for i, which is determined by the assignment: