computing theory problem

1.a.1 (10 points) Complete the diagram of Mo to show a DFSM converted from MNO. Include a dead state if needed. Remember that E-transitions, and multiple transitions on the same input symbol, are not allowed in a DFSM; and that the states in a converted DFSM are labeled with the set of states the NDFSM could be in after reading the same input. Your diagram must be easy to interpret or it will not be graded. NDFSM MNO MD - complete the diagram of a DFSM converted from MNO 1.b (13 points) = {a}, L = {w: w = an, n = m2, m 2 0}. For example: aaaa e L because aaaa| = 4, and 4 = 22; a 25 L because 25 = 52; aaa & L because aaa| = 3, and 3 is not the square of a natural number. Use the RL pumping theorem to show that L&RLS