25. which of the following is the correct function to find the number of leaves in a binary tree? (Total Points: 1) a. int binaryTreeType::leavesCount(binary TreeNode p) const { if (p==NULL) return 0 ; else if (p> llink == NULL \& \& p->rlink == NULL ) return 1 ; else return leavesCount(p> llink )+ leavesCount (p>rlink);} b. int binaryTreeType::leavesCount(binaryTreeNode * p) const { if( p>1 link == NULL \& \& c. int binaryTreeType::leavesCount(binaryTreeNode p) const { if (p==NULL) return 0 ; else if(p->llink==NULL \& \& p->rlink==NULL ) return 1; else { leavesCount(p->1link ) leavesCount (p>rlink);} \} d. int binaryTreeType::leavesCount(binaryTreeNode p) const { if (p>1 link == NULL \& \& p>rlink=NULL) return 0 ; else return 1+ leavesCount (p>1 link )+ leavesCount(p> rlink); }