Draw a nfa M2 to accept language L2 over {a,b,c}, specified by the following grammar: G2: SaSaA, A B C, B bb, CS 2. 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, abbaccabb 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. Draw a nfa M2 to accept language L2 over {a,b,c}, specified by the following grammar: G2: SaSaA, A B C, B bb, CS 2. 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, abbaccabb 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