Question & Answer: Given the complete binary tree below. Path Sum of a Path Through the Tree = sum…..

Given the complete binary tree below. Path Sum of a Path Through the Tree = sum of the values of the nodes in the path. If the method (written to find the largest Path Sum value in a the given tree) uses a greedy algorithm to find the largest path, will the method find the correct path in the tree above? Explain your answer, and show the path that the method would find.