$(15$ points$)$ Please use a recursion tree to show howt of find $h(24)$ for the finction below:

$h(n)=n,$ when $n<mn>3</mn>$

$h(n)=h(\frac{n}{3})+h(\frac{n}{2}),$ otherwise

Note that $n$ is an integer sot the result of $\frac{n}{?}($or $\frac{n}{3})$ is the biggest integer smaller than $n2($or

n$/3).$ See Algorithm$\_5\_$DivideandConquer$-1$ PPT$,$ slide $44$