I have to write on the OCaml... I'm not sure how to write the intro for each function.

1. In trees.ml: - Copy this line to the start of the file: Node of 'a * 'a tree * 'a tree - Write a function of type that returns a tree with one node. For example, is is Node ("2041", Leaf, Leaf) because the tree is a leaf. - Write a function of type that returns the rightmost datum in the tree. If the tree is only a leaf, it returns For example, (Node ("hello", Leaf, Node ("world", Leaf, Leaf))) is - is(Node(3. because the tree is a leaf. - Write a function of type that horizontally flips the tree. Grab a piece of paper to draw some trees. For example, , Node (2, Node (1, Leaf, Leaf), Leaf), Node (4, Leaf, Leaf))) is Node ( 3 , Node (4, Leaf, Leaf), Node (2, Leaf, Node ( 1 , Leaf, Leaf))) is ("hi", Leaf, Leaf)) is (the same as input) because it is symmetric Write a function of type ((a b bool) ' tree bool where checks whether there is any datum in the tree such that is . For example, is because the functional argument is - Try different predicates and trees! It is a useful skill to come up with new cases, and you are encouraged to share those cases with others