Please .. I want the solution to be in Java code form

Question 2 Not yet answered Write a java method that receive a reference to a binary tree root and finds the maximum sum of values from root to a leaf. Marked out of 13.00 P Flag question 6 10 5 The maximum sum is 18 and the maximum sum path is [1, 3, 5, 9). Assume that tree nodes contain integer