Let M e the NFA with these changes made. (a) Draw the machine M', using the same state names as in M, with the new start state called 5. Hint: M has 5 states, with 9 armows/ transitions between states. (b} Show a sequence of transitions to show that 0100 is accepted by M7, ic) Use the e-cdosure of states and the e -closed transition table, and the subset construction, to find a DFA which accepts the same language as accepted by M7, Let this DFA be called M?. (Note you are not designing M? from scratch; you are making a suitable transformation of M) Hint: M7 has 6 states, including the deacd SLate. (d) Go through the minimization process applied 10 MY, Write the minimized machine in standard form