Problem 5:
a) Draw the DFA state machine for the following DFA M = {{q1, q2, q3, q4, q5}, {a,b}, ?, q3, {q3}},
where transition function ? is
a b
q1 q1 q2
q2 q1 q3
q3 q2 q4
q4 q3 q5
q5 q4 q5
b) Write a regular expression for the language of the given DFA