Answer Happy

Please its compulsory to attempt both the questions, because
these are short questions, because in question 2 you only need to
give the name of class of language. but for please solve all the
parts. because according to answers policy you can answer 4 questions
in a link if these are shorts question. So i can't post them
separately. I will give you thumbs up vote for this. if you will
solve both, otherwise don't try to solve if you don't know the
exact answer. for this i will give you dislike vote.
Subject. Automata theory
Question 1. Consider the alphabet I = {a.b.c} and the language L of all string in {a,b) such that they do not contain two b's in a row. For example, strings 2, a, b and abab are all in L, but the strings bb, abb, and bbad are not in L. (a) Produce a DFA that accepts L. [3 marks] (b) Is your automaton complete? If yes, state why, and if not, then make it complete. [3 marks] Question 2 For each of the languages below determine the smallest class of languages to which the language belongs. No reasoning is required just write the words "Regular" for the class of regular languages, "Context-free" for the class of languages which are context-free and not regular, or "Recursive" when a language is recursive. [5 marks] (a) L= {xa"+" yn,mEN, n > m+3}, (b) L={a"be" | a,me Nn is odd and m is the double of n}. (c) L= = {aba a € {xy}', meN}, (d) L={xa" y6.3 n,me N, n > 3, m >5}, (e) L={q"b*n,mEN] {a" 22neN}