Describe an algorithm that computes the total awkwardness of the least awkward subset of k employees, assuming the company hierarchy is described by a binary tree. That is, assume that each employee directly supervises at most two others.

Who should have a career portfolio, and how often should it be updated? only artists need a career portfolio, which they should update after every gallery show. everyone should have a career portfolio, which they should update daily with their professional activities. all students should have a career portfolio, which they should update ever semester until they graduate. most professionals need a career portfolio, which they should update with regularly with important achievements.