Prove that for a full binary tree $T$ with $n$ nodes and

height $h,$ the total number of nodes is at least $2h+1$ and at

most $2^{h+1}-1($Hints: the results of question $1$ and $2$ can be

used to show the proof$).($points $2)$