Here's my attempt:
Suppose $(a_n)$ isn't bounded. Then $(\sqrt{a_n})$ won't be bounded either. Hence, $\sum \sqrt{a_n}$ is divergent. Now, if $(a_n)$ is bounded, then for all $n$, $a_n < M$ for some $M>0$. Then $\frac{a_n}{M} < \frac{\sqrt{a_n}}{\sqrt{M}}$ for all $n$. Since, $\sum a_n$ diverges, so must $\sum \sqrt{a_n}$ by the comparison test.
Is this a valid proof? Alternative proofs are welcome.
We assume series with positive terms, so convergence is also absolute convergence.
$\sum b_n$ converges $\implies b_n\to 0$ and in particular $b_n<1$ for $n\gg 1$ large enough.
Multiplying by $b_n$ we get ${b_n}^2<b_n$ thus $\sum {b_n}^2$ converges too.
By contraposition $\sum {b_n}^2$ diverges $\implies \sum b_n$ diverges.
Apply to $b_n=\sqrt{a_n}$.