Please solve the above all Three parts compulsory. Please solve according to the conditions given above. All parts are compulsory to Answer because these are related to each other I can't post them separately. I will give you a thumbs up vote for this. If you don't know the exact solution then no need to solve. Please solve accordingly as the marks distribution. Provide a state diagram in part a. It's also necessary.

3. An NFSA M defined over the alphabet X={0,1} has the following state diagram: (a) [2 marks.] Draw the dual machine (M) of M. (b) [6 marks.] Use the subset method to find a DFSA (M) equivalent to M, and re-name the states to give N. (c) [3 marks.] Give the transition sequence for the input string 1011 using N as in (b) above, and use this to decide if the string 1011 is accepted by M itself, giving brief reasons for your