in java suppose all employess in your orginiazation are respeneted in a tree such that each node contains the name of an emoloyee, a float for thier salarya, a node representing their manage$($null for ceo$)$ and a list of node representing empolyess who report ot them write the doe that does

a given the two nodes represneting employess find the lowest rnaking manager they have in common $($this may reuqier an additional data structer$)$

b given a node representing a manager, give the manger and everyone in their reporting struucture a $10\%$ raise

c given an employess name as a string find thier node in the tree$-$ can b be done recrusviely?