Question 3 (10 marks) Recursion: Write a recursive function that will count the number of leaf nodes in a binary tree. rootl root2 B F A Note: rootl and root2 are instances of the class BinNode: public class BinNode public int value; public BinNode left; public BinNode right; Thus, the following statements would lead to the underlined output: Example 1: System.out.printIn ( countLeafNodes (root1) ); 3 Example 2: System.out.printIn ( countLeafNodes (root2) ); 1