4. [10pt] (Submit JFLAP files and a print out on your HW answers) Consider the NFA with start state go, final state 03. and below transition function. Call the language that it recognizes L. 01 90 90,91} {93} {93} 1 {93} {92} | 0 0 {92} | 0 (a) Provide the state diagram of NFA that recognizes L. (b) Use the procedure described in Theorem 1.39 of textbook to convert the NFA to its equivalent DFA