Using JFLAP construct an NFA with three states that accepts the language (01 +012) Using input string "0120101" and "0112", try "multiple run" optio Submit your screen shot from JFLAP Convert the following NFA into an equivalent DFA You should show a table! (initial state: qo, final states:q3 and 44, - {a}) 92 93 90 95 5) Construct a right-linear grammar for the language, L-{a" 6": n. 1. m 2)