[tex]a_n=\sqrt{\dfrac{(2n-1)!}{(2n+1)!}}[/tex]
Notice that
[tex]\dfrac{(2n-1)!}{(2n+1)!}=\dfrac{(2n-1)!}{(2n+1)(2n)(2n-1)!}=\dfrac1{2n(2n+1)}[/tex]
So as [tex]n\to\infty[/tex] you have [tex]a_n\to0[/tex]. Clearly [tex]a_n[/tex] must converge.
The second sequence requires a bit more work.
[tex]\begin{cases}a_1=\sqrt2\\a_n=\sqrt{2a_{n-1}}&\text{for }n\ge2\end{cases}[/tex]
The monotone convergence theorem will help here; if we can show that the sequence is monotonic and bounded, then [tex]a_n[/tex] will converge.
Monotonicity is often easier to establish IMO. You can do so by induction. When [tex]n=2[/tex], you have
[tex]a_2=\sqrt{2a_1}=\sqrt{2\sqrt2}=2^{3/4}>2^{1/2}=a_1[/tex]
Assume [tex]a_k\ge a_{k-1}[/tex], i.e. that [tex]a_k=\sqrt{2a_{k-1}}\ge a_{k-1}[/tex]. Then for [tex]n=k+1[/tex], you have
[tex]a_{k+1}=\sqrt{2a_k}=\sqrt{2\sqrt{2a_{k-1}}\ge\sqrt{2a_{k-1}}=a_k[/tex]
which suggests that for all [tex]n[/tex], you have [tex]a_n\ge a_{n-1}[/tex], so the sequence is increasing monotonically.
Next, based on the fact that both [tex]a_1=\sqrt2=2^{1/2}[/tex] and [tex]a_2=2^{3/4}[/tex], a reasonable guess for an upper bound may be 2. Let's convince ourselves that this is the case first by example, then by proof.
We have
[tex]a_3=\sqrt{2\times2^{3/4}}=\sqrt{2^{7/4}}=2^{7/8}[/tex]
[tex]a_4=\sqrt{2\times2^{7/8}}=\sqrt{2^{15/8}}=2^{15/16}[/tex]
and so on. We're getting an inkling that the explicit closed form for the sequence may be [tex]a_n=2^{(2^n-1)/2^n}[/tex], but that's not what's asked for here. At any rate, it appears reasonable that the exponent will steadily approach 1. Let's prove this.
Clearly, [tex]a_1=2^{1/2}<2[/tex]. Let's assume this is the case for [tex]n=k[/tex], i.e. that [tex]a_k<2[/tex]. Now for [tex]n=k+1[/tex], we have
[tex]a_{k+1}=\sqrt{2a_k}<\sqrt{2\times2}=2[/tex]
and so by induction, it follows that [tex]a_n<2[/tex] for all [tex]n\ge1[/tex].
Therefore the second sequence must also converge (to 2).