$($b$)$ Use a recursion tree to compute an asymptotic solution for the recurrence

$J(n)=J(\frac{n}{2})+J(\frac{n}{3})+n.$