[Ocaml Language]

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

(* problem 2*) let smallest_divisor : int -> int = fun n -> (*TODO*) 

Problem 2 (10pts) Write a function smallest divisor: int -> int that finds the smallest integral divisor (greater than 1) of a given number n. For example, smallest-divisor 15 = 3 smallest.divisor 121 -11 smallest-divisor 141-3 smallest-divisor 199-199 Ensure that your algorithm runs in (Vn) steps