(40 points) In a company, the supervisor-supervisee relation can be represented by a single tree T, with the president being the root of the tree. Given the tree T, you are asked to compute the maximal number of employees that can be invited to a party such that an employee and his/her immediate supervisor cannot be invited at the same time. Please design an efficient algorithm for this problem and analyze its time complexity. 3. Show transcribed
OR
OR