ive state diagrams of NFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0,1}. g) The language {ε} with one state

No plagarism please! Correct and detailed answer will be Upvoted else downvoted. Thank you!

Hello can you please help me with part A I only need help is with part A because I don't understand how to do this. can you please write something visual to help me understand. only need help with part A

Question 2 Find the CFG for the following Language: L1 0nr 1 n ≥1, r 20}

For each of the languages below, draw a transition diagram for a DFA which accepts thatlanguage.(a) Strings over Σ = {a, b, c} which begin with the character a and end with the character c.(b) Strings over Σ = {a, b} in which the characters a and b always alternate. For example, stringsababa, bab, and a are in this language.(c) Strings over Σ = {a, b} which end with either aa or bb.(d) Strings over Σ = {0, 1, 2}, such that the sum of all digits in the string is divisible by 4.For example, the string 02101 is in the language because 0 + 2 + 1 + 0 + 1 = 4, which is divisible by 4;but 1212 is not, because 1 + 2 + 1 + 2 = 6 is not divisible by 4.