Prove the upper bound on $T\left(n\right)=T\left(\log_{2}n\right)+O\left(\sqrt{n}\right)$
By simple substitution, you can see that $T(n) = O(\sqrt{n}) + O(\sqrt{\log n}) + O(\sqrt{\log\log n}) + \dots = O(\sqrt{n})$.