In lecture, we define Church number n as f n. (f n z), where (f n z) represents the n-fold composition of function f applied to z (i.e., f(f(. . .(f z))) where f is repeated for n time

(5pt) Implement a function encode, which takes a natural number n and returns the church encoding of n. For example, (encode 2) should return 2 (i.e., the function f. z. f (f z)).

You may NOT use any of Schemes imperative features (assignment/loops) or anything else not covered in class.