Answer All Questions. Sure all work done for each problem. Write Legibly, I cannot guess your answers. Answer 1. If we want to create a binary tree whose nodes contain integer values, we can represent the nodes using instances of the following Java class. /* binary tree node with integer node values/ public class BTNode public int value; // value contained in this node public BTNode left; // left subtree; null if empty public BTNode right; // right subtree; null if empty Complete the definition of the following method so it returns the sum of the values contained in all of the nodes of the binary tree with root n. Hint: Recursion is your friend. b. Show that 3n' +100 m2+42n is O(n)