Consider the languages described below:$$a$.$ b$.$c$.$ d$.$w in $($a$|$b$)+$ so that the characters in every odd position $(1,3,5...)$ are all a$$s $($a$,$ aa$,$ ab$,$ aba, acab,...$)$ What is the smallest class this language is in$?$ Regular$/$Context Free$/$Decidable$/$Acceptable$?($RCDA$)?$anb$2$na$3$n $|$ n $>=0$What is the smallest class this language is in$?$ Regular$/$Context Free$/$Decidable$/$Acceptable$?($RCDA$)?$w in $($a$|$b$)*$ so that the length of w is even and the first half is all a$$s $($that is$,$ no b$$s in the first half$).$ What is the smallest class this language is in$?$ Regular$/$Context Free$/$Decidable$/$Acceptable$?($RCDA$)?$Complement of a$*$b$*=.$

What is the smallest class this language is in$?$ Regular$/$Context Free$/$Decidable$/$Acceptable$?($RCDA$)?$e$.$ Encoded Turing machines that accept the string w$=$epsilon.$$What is the smallest class this language is in$?$ Regular$/$Context Free$/$Decidable$/$Acceptable$?($RCDA$)?=====$f$.$ g$.4.$ a$.$b$.5.$ a$.$ b$.6.$ a$.$ b$.$ c$.7.$ a$.$b$.$For any one of the regular languages in parts a$-$e$,$ write a DFA for the language$$For any one of the context free languages in parts a$-$e$,$ write its context free grammar.