Complete the following Haskell function definitions. Unless stated otherwise do not use library functions that are not in the Haskell standard prelude

5. [2 marks] Consider the following definition for a binary tree data Tree a Leaf a I Node (Tree a) (Tree a) A binary tree is balanced if, at every node, the difference between the number of leaves appearing in the left and right subtree is at most one. (A tree which contains just one leaf is considered balanced.) Wite the function idreeoohtes i the tree is balanced. Hint: first write a function size: :Tree a ? Int that counts leaves in a tree isBalanced (Node (Node (Leaf 1) (Leaf 3) ) (Leaf 2)) ? True isBalanced (Node (Node (Leaf 1) (Node (Leaf 1) (Leaf 3))) (Leaf itie a e i 3)) cst False 5. [2 marks] Consider the following definition for a binary tree data Tree a Leaf a I Node (Tree a) (Tree a) A binary tree is balanced if, at every node, the difference between the number of leaves appearing in the left and right subtree is at most one. (A tree which contains just one leaf is considered balanced.) Wite the function idreeoohtes i the tree is balanced. Hint: first write a function size: :Tree a ? Int that counts leaves in a tree isBalanced (Node (Node (Leaf 1) (Leaf 3) ) (Leaf 2)) ? True isBalanced (Node (Node (Leaf 1) (Node (Leaf 1) (Leaf 3))) (Leaf itie a e i 3)) cst False