/ ** * Definition for a binary tree node. * / public class TreeNode { int val; Practice 1 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the...

Please answer the question in the screenshot. The language used here is Java. Please use the starting code.

Extracted text: / ** * Definition for a binary tree node. * / public class TreeNode { int val; Practice 1 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. Note: A leaf is a node with no children. TreeNode left; TreeNode right; TreeNode (int x) { val = x; } } Example: Given the below binary tree and sum = 22, class TreeDFS { %3D 5 public boolean hasPathSum(TreeNode root, int sum) { } } 4 8 11 13 4 7 2 1 return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.