need help with q4 from exercises(1st picture) by the theorem(2nd pic) given in the picture ?

217 us the imia s that the langunge to'01 han infeitely many u was shown that lan '2. ces and therefore ie not ex a hine can be con ttueosem will be wsed to show that the langage Theorem 676 h this, we sheow that nd a' wee distingsinhabtile ty the m L. The later string is not in t. since it has length greaner than ses is the achins eti . Conc menaking a with each of these vtrings produces elastion weneL. The later string is not in t since a has lengh greaker han The Mybi eland a of distimct equivalence classes of L btained from M by misi imal state DFA valence classes of at associates a set of with state le.1s Exercises 1. Use the wechnisqme from vac from Section 6 2 to build the state diagram of an NFA- that accepts ab) ba. Compare this with the DFA constructed in Esencise $.22 a) he state diagrams in Exercise 540, use Algorthm 622 to eonstruct . s a set of ing C he language (ab) Lmplar expression for the language accepted by the automate , The language of the DFA M in Example 5.3 4 consists of all strings iver la, b wt ? even number of a's and an odd number of b's. Use Algonithm 6.22 to construct recular expression for LiM) Exercise 2.38 requested a sonalgorithmic comstruction of a regular espression for this language. which, as you now see. is a formidable task. et G be the grammar t and M. respectiveh hys lence class of- e number of equivalenedae at else leD and cllle) lies that there are strings M ing w that distinguishes t onaccepting or vice ver in L. This is a contraiia ship value in L for all M' is greater than the une a) Use Theorem 6.3.1 to build an NFA M that accepts LIG) b) Using the result of part (a), build a DFA M that accepts LiG) c) Construct a regular grammar from M that generates LiM). d) Construct a regular grammar e) Give a regular expression for L(G). 5.Let M be the NFA eorem gives another neb is not regular if the s