3. Converting an NDFSM into a DFSM. {0,1}, and the NDFSM MN in shown the diagram below. 3.a (2 points). Write a characteristic function for L(MN) 3. b (6 points). Convert MN into a DFSM Mo, adding a dead state if needed, and labeling the states of the Mb with the set of states that MN could be in after processing the same input. For example, if it were possible for Mn to be in either state qj or qk after processing a string w, then there must be state in Mo labeled {q, qk). Do not include any non-deterministic features in MD, such as transitions, or multiple transitions on the same input symbol Ho 2 3