Please I want detailed complete answer for each part, please make sure you provide clear pictures of solution.

Thank you so much

5. (a) Describe the languages accepted by the four automata whose transition diagrams are given above ( is the initial state): (b) For cach of these automata construct an equivalent DFA. 6. Determine the languages accepted by the automata whose transition diagrams are given below ( is the nitial state) a, 7, Let L be the language of all words over _ {0.1} in which 00 does not appear (a) Construct the transition diagran of a DFA M thal accepts L (b) Give M formally as a 5-tuple as n Delinition 2.1 of the book 8. Construct the transition diagrams of IDEA M, and M2 with 1,1 = h(M1) and 12 =(M2); (b) 2 aba, abb, baa 9. Show that the language L = {1) | u: E {a,h' } is regilar 10. Let = {0.1). We can view a -string 21, which starts with the letter 1 as a binary number (where the rightmost character of the string is the least significant digit of the number). Construct transition diagrams of NFA accepting the following languages: (b) {to E +lte is a power of 2} (c) (wE2+is even