I have given 2 algorithms with their time-complexity $t_a(n)=\sqrt{n}$   and $t_b(n) = 2^{\sqrt{\log _{2}n}}$ and i have to show $t_b(n) = O(t_a(n)) $.

I´ve made a program to check this statement and it seems that for any given $c>0,\forall n\geq16$  it holds, however i don´t know how to formally proof this ,because i can´t find any simplification for $t_b$. 

I know that i must prove $	\exists c   
 : \forall n	\geq N:t_b(n) \leq c *t_a(n)$ using big-O-Notation.