D. (15 points) Consider the following NFA M that accepts language L-LIM) i. (3pt) Give the Regular lixpression . (pt) Convert the NFA M to DFA N and fill in the following transition table for N. Transition Table for DFAN 0 1 Accepting state? Reachable from (A)2 A) (B) (A,B) (3pt) JLA in draw DFA transition diagram and give the following Donelade any reachable states from the initial statel Include the test for the first 5 wocopted strings and the first rejected strings in the screen shot. iv. V (2pt Convert DFA N to a regular expression that produces the same language (2p) briefly describe the language wepted by the regular expression at the previous step (20) Convert DFA N to a lett tioner arammar that seaduses the same made vi