Leaf Nodes and Tree Height Consider the following two functions that determine the height of tree, and the number of its leaves, respectively: height :: Tree a > Int height Nul 1 height (Node 1 x r) = 1 + max (height 1) (height r) -- H2 H1 leaves :: Tree a -> Int leaves Nul1 leaves (Node 1 x r) = (leaves 1) + (leaves r) L1 2 Show, using tree induction, that 1 + leaves t