please answer all

2. Write down the transition function for the given DFA. 3. Consider the given NFA over alphabet {a,b,c,d}. The following are YES/NO questions about strings this NFA may accept. a. a b. bbbcbbccba c. bbbcba d. bbbba 4. Give a regular expression that represents the language accepted by this NFA. 5. Book Section 11.2 Problem 2a Construct an DFA for the regular expression ab+bc. ion for the given phabet {a,b,c,d}. tions about strings represents the