1. Consider the following mystery function on a binary tree (not necessarily a BST). public int mysteryHelper(TreeNode cur){ if(cur==null) return 0; else{ int r=mysteryHelper(cur. getLeft()) + mysteryHelper(cur. getRight()); if(((cur. getLeft()!=null && ((Integer) cur. getLeft().getValue())pareTo(cur. getValue())>0)|| (cur. getRight()!=null && ((Integer) cur. getRight().getValue())pareTo(cur. getValue())<0)){ r++; } return r; } } public int mystery(){ return mysteryHelper(root); }