Use ocaml to solve the functions: min$\_$ltree and range$\_$ltree. DO NOT USE RECURSION!!! Use a higher order function to solve like List.fold$\_$left

Consider the tree type from Homework $02$ here renamed to ltree.

type 'a ltree $=$ Leaf $of\text{'}a$

I Branch $of$ 'a Itree $*$ 'a ltree

From Homework $02,$ reimplement the following functions using higher order functions instead of recursion, but on the ltree type

defined above:

min$\_$ltree : int ltree $$ int

This should return the minimum value of the tree, ie$.$

min$\_$ltree $($Leaf $4)=4$

min$\_$ltree $($Branch$($Branch$($Leaf $3,$ Leaf $(-1)),$ Branch$($Leaf $2,$ Leaf $9)))=-1$

range$\_$ltree : int ltree $($int $**$ int$)$

This should return a pair containing the minimum and maximum value of the tree, ie$.$:

range$\_$ltree $($Leaf $4)=(4,4)$

range$\_$ltree $($Branch$($Branch$($Leaf $3,$Leaf $(-1)),$Branch$($Leaf $2,$Leaf $9)))=(-1,9)$