Question 5. (10 points) Suppose we have a complete k-ary tree with n leaves (suppose n=kd for some integer d ). Each leaf v is associated with a weight w(v). The weight of an internal node is defined to be the sum of the weights of all leaves that are descendants of this node. So the weight of the root r is w(r)=leavesvw(v). Design and analyze an algorithm to compute the weight of every internal node