[Ocaml Language]

Please solve this question by completing (*TODO*) in this code:

(* problem 3*) let iter : int * (int -> int) -> (int -> int) = fun (n,f) -> (*TODO*) 

Problem 3 (10pts) Define the function iter: iter : int * (int -> int) -> (int -> int) such that When n = 0, iter (n,f) is defined to be the identity function, when n 0, iter(n, f) is the function that applies f repeatedly n times. For instance, iter(n, fun x -> 2+x) 0 evaluates to 2 n. Problem 3 (10pts) Define the function iter: iter : int * (int -> int) -> (int -> int) such that When n = 0, iter (n,f) is defined to be the identity function, when n 0, iter(n, f) is the function that applies f repeatedly n times. For instance, iter(n, fun x -> 2+x) 0 evaluates to 2 n