You may NOT use any of Schemes imperative features (assignment/loops)

DONT USE OTHER ANSWERS FROM CHEGG

Problem 1[20pt] In lecture, we define Church number n as fn.(fnz), where (fnz) represents the n-fold composition of function f applied to z (i.e., f(f((fz))) where f is repeated for n times). a) (5pt) Implement a function funPower, which takes a function f, an integer n and returns the function fn. For example, ((funPower sqrt 2) 16) should return 2