I got for homework the following recurrence relation: $T(n)=n^\frac{2}{3}\cdot T(n^\frac{1}{3})+c $
and $T(1)=O(1) $ $\forall n\leq2 $
And this is what I got so far:
by using the iterative method I got that the for any $k$ :
$T(n)=n^{1-\frac{1}{3^k}}\cdot T(n^\frac{1}{3^{k+1}})+c+cn^\frac{2}{3}+cn^{\frac{2}{3}+\frac{2}{9}}+...+cn^{\frac{2}{3}+\frac{2}{9}+...+\frac{2}{3^{k-1}}} $
and the maximum level of the tree is for $k=log_3(log_2(n))$ then for $k=log_3(log_2(n))$ :
$T(n)=n^{1-\frac{1}{3^{log_3(log_2(n))}}}\cdot T(2)+c+cn^\frac{2}{3}+cn^{\frac{2}{3}+\frac{2}{9}}+...+cn^{\frac{2}{3}+\frac{2}{9}+...+\frac{2}{3^{log_3(log_2(n))-1}}} $
$T(n)=n^{1-\frac{1}{log_2(n)}}+c+cn^\frac{2}{3}+cn^{\frac{2}{3}+\frac{2}{9}}+...+cn^{\frac{2}{3}+\frac{2}{9}+...+\frac{2}{3^{log_3(log_2(n))-1}}} $
and $n^{1-\frac{1}{log_2(n)}}=\frac{n}{2}$
so,I get :
$T(n)=\frac{n}{2}+c+cn^\frac{2}{3}+cn^{\frac{2}{3}+\frac{2}{9}}+...+cn^{\frac{2}{3}+\frac{2}{9}+...+\frac{2}{3^{log_3(log_2(n))-1}}} $
also the sum in the power of the last element is : $\frac{2}{3}+\frac{2}{9}+...+\frac{2}{3^(log_3(log_2(n))-1)}=1-\frac{1}{log_2(n)} $
so, the last element is also equal to $\frac{n}{2}$ so far I got :
$T(n)=\frac{n}{2}+c+cn^\frac{2}{3}+cn^{\frac{2}{3}+\frac{2}{9}}+...+c\frac{n}{2} $
how to proceed from here?