Question 3 (10 marks) Recursion: Write a recursive function that will calculate the height of a binary tree. root1 root2 B E A Note: root1 and root2 are instances of the class BinNode: public class BinNode { public char value; public BinNode left; public BinNode right; } Thus, the following statements would lead to the underlined output: Example 1: System.out.println( treeHeight (root1)); 3 Example 2: System.out.println( treeHeight (root2) ); 1 Please write your method on the following page. Please write your method on the following page. Page 5 of 7 public static int treeHeight (BinNode current) {