Given a tree T of nodes such that each node contains a number. A set of nodes S is an independent set of T iff no node of S is a parent of another node in S. Describe a dynamic programming algorithm to find an independent set of T such that the sum of numbers of nodes in the set is the largest among all possible independent sets of T.