0 (90) 0 0 NFA M for Question 2. Question 2. Consider the following non-deterministic finite automaton N. a) Draw its transition table. b) Is string 100 accepted by this machine N? If yes, write the corresponding computation path for that and explain why. If not, justify why it is rejected. c) Is string 00101 accepted by this machine N? If yes, write the corresponding computation path for that and explain why. If not, justify why it is rejected. d) Write a regular expression for the language accepted by N. e) Construct a DFA equivalent to NFA N. Show all your work. f) Identify all formal components of the DFA constructed in part e. 0