In java pls

Created By: Geoffrey Challen Version: 2020.11.0 Create a public class Binary Treesize that provides a single static method size. size accepts a cs125. trees. BinaryTrees?>, a BinaryTree that can contain any value, and returns the number of nodes it contains. You'll want to count recursively, identifying both a base case and a recursive step. For reference, c5125, trees. BinaryTree has the following public properties: 1 public class BinaryTree \{ 2 public object getValue(); // returns the value 3 public BinaryTree getRight(); // returns the right node 4 public Binarytree getLeft(); // returns the left node 5 \} Don't overthink this! Like many recursive algorithms, the solution is elegant and simple: 4 lines total if you do it right. You'll also need to import cs125. trees. Binarytree for this and similar problems. This problem deadline has passed, but you can continue to practice. Experiment! You will not lose credit. 1