7. The following gives a design of a Binary Tree in Haskell and the function for ccunting nodes: data BTree a = Nil|Branch a (BTree a) (BTree a) connt Nil=0 coont (Bronch - left right) =( count left )+( count right )+1 Write each of the following functions on Binory Trees in Haskill. a. min_max (tree): This function retums a pair (min, max), where min is the minimum value, and max is the maximum value in tree. Note that the tree may not be a binory search tree. b. inc 1 (tree): This function returns a copy of tree, in which each nade value is incremerted by 1