A structure similar to a linked list is a binary tree. Instead of each node pointing to one following node, it may point to two. A simple implementation of node for a binary tree is shown below. For this question, you are to implement a method called getsize that takes first node in a binary tree (its root) and returns the number of nodes in the tree.

1. Using the fantastic four approach, determine the size n problem for the method getSize. I1 point]

2. Identify the stopping condition(s) and the return value, if any, for the problem 1 point]

3. Determine the size m problem (i.e. the "subproblem for the problem 1 point

4. How is the size-n problem constructed from the size m probleli 1 point]

5. Implement the method public static int getSize(BinraryNode node) H points]