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 times).

(5pt) Implement a function decode, which takes n (the Church encoding of some natural number n) and returns n. For example, (decode (encode 2)) should return 2.

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