Q$16.2\mathrm{.}2)[4$ points$]$ Consider the below tree and answer the following questions $($not in

terms of big$-$O; if you answer in terms of big$-O,$ you will get half the point$)$:

Q$16\mathrm{.}1.$

What is the input size per node in terms of $n$ at any level $m?[0\mathrm{.}5$ point$]$

Q$16\mathrm{.}2.$

What is the number of nodes at any level $m?[0\mathrm{.}5$ point$]$

Q$16\mathrm{.}3.$

What is the total number of operations per recursive call in level $m?[2$ point$]$