unose you are organizing a company party. The corporation has a hierarchical ranking structure; that is, the CEO is the root node of the hierarchy tree, and the immediate subordinates are the children of the root node, and so on in this To keep the party fun for all involved, you will not invite any employee fashi on. te superior is invited. Every employee is equally valued, so we would like to maximize the total number of employees invited. Everyone in the corporat hierarchy (including the CEO) is considered an employee A) Provide a greedy algorithm to solve this problem. (8 pts) B) Prove that your algorithm produces an optimal solution. (8 pts)