Create a public class called YourBinaryTree that extends BinaryTree, override protected int sum(), and return the sum of the values of the nodes in the tree, which will all be Integers. A portion of the BinaryTreeclass that you are extending is shown below for reference.

Create a public class called YourBinaryTree that extends BinaryTree, override protected int sum), and return the sum of the values of the nodes in the tree, which will all be Integers. A portion of the BinaryTree class that you are extending is shown below for reference. Follow our usual guidelines for writing recursive functions: 1. Identify the base case 2. Make the problem smaller at each step 3. Combine results appropriately Note that you will want sum to act as a wrapper class and call a private method private int sum (Node current) that starts the recursion on the root node. Also note that because your tree stores Objects, you will need to apply a cast to the value to include it in a sum. public class BinaryTree protected class Node f protected Object value; protected Node right; protected Node left; Node(0bject setValue) value setValue; protected Node root; public final void add(Object value) t add(root, value); // Portions omitted for brevity