Draw a nfa M2 to accept language L2 specified by the following grammar with Terminal-symbols {a,b,c} and Nonterminal-symbols {S,A,B,C}: G2: S as I aA, A bB ICC, B BSI b, C Sla. Enter M2 into JFLAP. Use JFLAP to simulate whether M2 accepts/rejects each of the following ten input strings: 2, aa, ac, cc, aac, aabb, abbc, abba, accaba, abac?ab? Convert your nfa M2 to an equivalent dfa M3, and then minimize M3's number of states. Have JFLAP simulate the same ten test cases on your minimum-state equivalent of M3