This is Introduction of Computation.

Please show complete steps.

2) (12 points) For each of the following languages over the alphabet = {a, b), give a DFA that recognizes the language a),-a, b, bb) b) L2 = { w | w begins with ab" and ends with a "ab" } . c) For any string w E2", let na(w) denote the number of a's in w. For example na(abbbba)-2 Define the language d) L4 L3 where La is the language in part c)