Use Haskell

We define a new type of labeled trees in which both leaves and nodes are labeled by data elements of type a: data LTree a = LLeaf a LNode a (LTree a) (LTree a) deriving Show Problem Set 1 Implement each of the following functions, using recursion and pattern-matching. 1. getLeaves :: LTree a -> [a] takes a labeled tree and returns the contents of the leaves of the tree in a single list: getLeaves (LNode "root" (LLeaf "left") (LLeaf "right")) = ["left", "right