points$)$ For each of the languages listed below, indicate the smallest class of languages which contains it$,$ among the classes Regular, Context$-$free, Decidable $($Turing$-$decidable$),$ and Turingrecognizable. No partial credit for this problem.

$($a$)\{0^n{1}^n{0}^m|n,$minN$\}$

$($b$)$ The set of strings with equal number of $0\text{'}$s and $1\text{'}$s$.$

$($c$)$ The language $\{a^n{b}^{2n}{c}^{3n}|n0\}$

$($d$)\{a^n{b}^m{a}^p{b}^q|n,m,p,q0\}$

$($e$)$ The language is a Turing machine that halts on $w$

$($f$)$ The language is a CFG and

g$)$ The language is a Turing machine and $M$ accepts $w$

The union of two languages: $|),(n0$ and $\{$:$mn\}$ and $\{a^n{b}^n|n0\}.$