Exercises for Section 2.3 2.3.1. Find a regular expression for the language of all strings over (a, b) that have an even number of b's. Construct a transition diagram for this language ct a transition diagram for the regular language given by c"(a U be. Convert your diagram into a table, as in Figure 2.5, labeling the states go. q1... 2.3.3. Let M = {Q, ?, s, F, ?} be given by ? = {0,1} and 6 given by the table in Figure 2.11. 43 91 92 Figure 2.11 Construct the transition diagram. Give the sequence of states in accepting the string 110101 (the leftmost character is the first to be analyzed). 2.3.4. Is Figure 2.12 the transition diagram of a dfa? Why or why not