(Haskell Programing) Part 1- A Complete Binary Management Tree: In the first part of this assignment, your program will use two lists of unique position names and two lists of floats for salaries of each position to establish a management tree. The first list of names and the first list of salaries are related to leaf nodes and other lists are related to the root and internal vertices. For simplicity, this management tree will be a complete binary tree. "A complete binary tree is a binary tree where all internal nodes have degree two and all leaves have the same depth". Please consider the imaginary management tree of the NEW UNIVERSITY in Figure 1 as an example. This example is used for the following sample run Rector $100,000 Dean Social Sciences $70,000 Dean Engineering $70,000 Director of Human Vice president Board of Social Sciences $50,000 Vice president Board of Engineering $50,000 Officer Research Coordination 30,000 $50,000