Select the appropriate code that performs NodeCount operation on binary trees: int binaryTreeType:: fun (binaryTreeNode *p) { if (p == NULL) return 0; else if ((p->left == NULL) && (p->right == NULL)) return 1; else return fun (p->left) + fun (p->right); } int binaryTreeType: :fun (binaryTreeNode *p) const { if (p == NULL) return 0; else return fun (p->llink) + fun (p->rlink) ; } int binaryTreeType:: fun (binaryTreeNode *p) const { if (p == NULL) return 0; else return 1 + max (fun (p->llink), fun (p->rlink)); } int binaryTreeType: : fun (binaryTreeNode *p) const { if (p == NULL) return 0; else return 1 + fun (p->llink) + fun (p->rlink); }