Give me some example problems for this and solve them:

For each language below, mark where it falls in the

complexity hierarchy $($picture starting each lecture$)$:

a$)$ Regular, b$)$ Context$-$Free but not regular, c$)$ Turing$-$

decidable but not CF$,$ d$)$ Turing$-$Recognizable but not

decidable, or e$)$ Not Turing$-$Recognizable;