Outlines:
a) When $n$ is large enough, $n^{3/2}a_n\lt 2$. Now it should be a straightforward comparison with $\displaystyle\sum \frac{2}{n^{3/2}}$.
c) Let $a_1=b$. Then $a_2\lt b\dfrac{1^2}{2^2}=\dfrac{b}{2^2}$. Therefore $a_3\lt b\dfrac{1^2}{2^2}\dfrac{2^2}{3^2}=\dfrac{b}{3^2}$. And so on. But $\displaystyle\sum \frac{1}{n^2}$ converges.
b) I am not happy about my suggestion for this one! Please see the Comment by David Mitra for a better approach that uses much less machinery.
By the Cauchy-Schwarz Inequality, we have, for positive $x_k$, $y_k$, that
$$\left(\sum_{1}^n x_k y_k\right)^2\le \left(\sum_1^n x_k^2\right)\left(\sum_1^n y_k^2\right).$$
Let $x_k=ka_k$ and let $y_k=\frac{1}{k}$. Then
$$\left(\sum_{1}^n a_k\right)^2\le \left(\sum_1^n k^2a_k^2\right)\left(\sum_1^n \frac{1}{k^2}\right).$$