$1.(15$ points$)$ Write a method with signature public static int countGreaterThanValue$($BinaryNode root, int value$)$ which gets a Binary Tree $($not BST necessarily!$)$ and a value as input parameters. It counts the number of values greater than value in the tree and returns the counter.

$2.(20$ points$)$ Write a method with signature public static boolean isSymmetric$($BinaryNode root$)$ which gets a Binary Tree $($not BST necessarily!$)$ and returns a boolean specifying whether the tree is a mirror of itself $($Symmetric around the center$).$

Example of a true return value: