please write in OCaml, Thank you!

Problem 8 Write a function type 'a tree = Leaf | Node of 'a tree * 'a * 'a tree fold_inorder : ('a -> 'b -> 'a) -> 'a -> 'b tree -> 'a That does a inorder fold of the tree. For example, fold_inorder (fun acc x -> acc @ [x]] [] (Node (Node (Leaf, 1, Leaf), 2, Node (Leaf,3,Leaf))) = [1;2;3] In [ ]: type 'a tree = Leaf | Node of 'a tree * 'a * 'a tree let rec fold_inorder f acc t = . (* YOUR CODE HERE *) raise (Failure "Not implemented") In [ ]: assert (fold_inorder (fun acc x -> acc @ [x]) [] (Node (Node (Leaf ,1,Leaf), 2, Node (Leaf,3, Leaf))) = [1;2;3]). Problem 8 Write a function type 'a tree = Leaf | Node of 'a tree * 'a * 'a tree fold_inorder : ('a -> 'b -> 'a) -> 'a -> 'b tree -> 'a That does a inorder fold of the tree. For example, fold_inorder (fun acc x -> acc @ [x]] [] (Node (Node (Leaf, 1, Leaf), 2, Node (Leaf,3,Leaf))) = [1;2;3] In [ ]: type 'a tree = Leaf | Node of 'a tree * 'a * 'a tree let rec fold_inorder f acc t = . (* YOUR CODE HERE *) raise (Failure "Not implemented") In [ ]: assert (fold_inorder (fun acc x -> acc @ [x]) [] (Node (Node (Leaf ,1,Leaf), 2, Node (Leaf,3, Leaf))) = [1;2;3])