a) Draw the diagram for a DFA that accepts any string over the alphabet {a,b} that contains an odd number of a's and an odd number of b's.

b) Is this regular expression equivalent to the DFA from part (a)? Briefly justify your choice.

(ab | ba) (aa | bb) + (ab | ba)

a) Draw the diagram for a DFA that accepts any string over the alphabet {a,b} that contains an odd number of a's and an odd number of b's. b) Is this regular expression equivalent to the DFA from part (a)? Briefly justify your choice. (abba) (aabb) + (abba)