b$.(5$ pts$)$ Let the size of a input to MERGE$-$SORT algorithm be $3n^2+4.$ What would be

the approximate number of the leaves and height of the recursion tree computed by the algorithm.