Problem 3. Let T be a binary rooted tree with positive, negative or zero weights on its edges. Describe and analyze an algorithm to compute the heaviest possible path that starts from the root. Argue that your algorithm is correct. Your algorithm should work in polynomial time. (Note the negative weights; in particular, if all edge weights are negative, the output will be a path of weight zero, just the root vertex)