General Tree In this part, you have been asked to create a simple ADT tree. A company asked you to create a tree like the following: As you can see you need the following: a Worker.java class, that only have name and salary attributes, you should have a constructor for this class. You need a Binary TREE ADT class to hold the tree. The Tree elements can have no children or many children (0,1,2,3,) A binary tree ADT needs the following Name of the method Possible* signature of the method Explanation Example Constructor Optional root() public static Worker root() Returns the root of the tree (or null if empty). [Returns object of Worker Type] parent(p) public static Worker parent(Worker p) Return the parent of worker p left(p) public static Worker left(Worker p) Return the left child of worker p right(p) public static Worker right(Worker p) Return the right child of worker p setLeft(p) public static Worker setLeft(Worker p) Set the left child of worker p setRight public static Worker setRight(Worker p) set the right child of worker p size() Return the size You need to also write a method to print the tree (nothing fancy!!) o You may do it in-order, preorder, Last part, create a main o create the workers with their name and salary o Add them to the tree similar to image, remember to use setLeft and setRight o Lastly use your print and print the tree Part 3: Analysis 1. What is the time complexity of adding new element to a binary tree? 2. What if we used general tree (0 to many children), what would be the time complexity of adding new element? Would the number of children have any effect on it? 3. What is the worst case for adding a new element to a general tree? 4. Is there a relationship with the height of a tree and time complexity?