You may import Data.List and use nub, sort, union. Write a haskell function called mergeTrees that takes as input a two trees t$1$ and t$1$ and returns a tree t$3$

containing all of the values in t$1$ and t$2.$