Please help with this OCaml code asap!!

Desugar the following (nonrecursive) let expressions to the equivalent fun expressions applied to arguments. You do not need to evaluate the resulting fun expressions. Use the OCaml interpreter to test that your desugared versions are equivalent to the original versions. (You don't have to prove this to anyone but yourself.) Note A non-recursive let / and form binds multiple values to the result of evaluating the corresponding expressions, but none of the binding expressions can depend on the other bindings. (In a recursive let rec/ and form, any or all of the binding expressions can depend on the bindings.) A non-recursive let / and form is therefore equivalent to a function of more than one argument applied to its arguments, as discussed in the lectures. let a=1.0 and b=20.0 and c=3.0 in sqrt (b,b4.0,a,c) C. For this problem, desugar all of the let expressions. Note that successive let/in forms are not the same as a let/and form with multiple ands, because expressions can depend on earlier bindings. let x=1 in let y=2 in let z=3 in xyz d. For this problem, desugar all of the let expressions. let x=1 in let x=2 in let x=3 in xxx