Consider a rooted \(n\) node binary tree represented using pointers. The best…

Consider a rooted $n$ node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes is $O(n^a\log^bn)$. Then the value of $a + 10b$ is __________.