(a) Using Thompsons construction, construct an NFA that recognizes the same language as dened by the following regular expression: (1*01*0)*1*

(b) Using the subset construction, convert the NFA into a DFA. Optimize the resulting DFA by merging any equivalent states.