Write simple PSEUDOCODE for the algorithm: Design an algorithm that solves the max-sum leaf-to-root problem. For example, the following diagram shows that the maximum leaf to root sum path is 4+4+2+1 = 11. Given the root r of the tree, return the sum of the values of the maximum leaf to root path. Only return the value of the sum. Use x.value for the value stored and x.isLeaf has value true if x is a leaf and false if it's not. To access the children use: for each child c of x do....

al 3