How to solve

$(5$ points ea$.)$ Choose the most specific $($and correct$)$ description for each language below. RE is Recursively Enumerable, which is the technical term for "recognizable by a Turing Machine".

a$.\{0^n{1}^{2n}|n0\}$

Regular

Deterministic Context$-$Free

Context$-$Free

Either Context$-$Sensitive or RE

None of the above

b$.|),(j$ and either $i=j$ or $\{$:$i=k\}$

Regular

Deterministic Context$-$Free

Context$-$Free

Either Context$-$Sensitive or RE

None of the above

c$.\{{10}^n{10}^m|m,n>0\}$

Regular

Deterministic Context$-$Free

Context$-$Free

Either Context$-$Sensitive or RE

None of the above

d$.\{0^n{1}^n{2}^n|n>0\}$

Regular

Deterministic Context$-$Free

Context$-$Free

Either Context$-$Sensitive or RE

None of the above

e$.\{w{w}^{Rx}|win\{0,1{\}}^{**}\}$ where $w^{Rx}$ is defined as on HW$7$:

If $w=(w_0,w_1,dots{w}_n)$ then $w^{Rx}=(w_n,x,w_{n-1},x,dots{w}_0,x).$

Regular

Deterministic Context$-$Free

Context$-$Free

Either Context$-$Sensitive or RE

None of the above