Haskell: Explain

e) Data Types: Using the following defininition Idata Tree = Leaf Int Node Tree Int Tree First, give a non-trivial example of a tree with type Tree. Secondly, define a function that decides whether a tree is balanced (see definition below). Is the tree that you have given as an example balanced? [Def: We call a tree balanced if the differences of the heights of left subtrec and right subtree at each node differ at most by 1.] [6 marks]