u tle third character is Ta,by* w does not end in ba 5. tw e (a, by':w has an even length and odd number of a's) Problem 2. Show an NDFSM to accept the following languages, using a pre- specified number of states: 1. fw e [0, 1)*:w ends with 00) using three states 2. fw e (0,1)*:w contains an even number of os, or exactly two 1s using six states 3. The language 0'1'0+ using three states Problem 3. Convert the following regular expressions to NFDSM, and then con- vert NFDSM into DFSM. All expressions are on the alphabet {a, b]*: 1. a(abb)* U b 2. a+ U (ab)