5. 12pt (Submit a JFLAP file and a printout on your HW showing accepted/rejected strings) Consider the following languages. In all cases, 2 = {0,1}. L1 = {w w starts with a 1 and ends with a 0} L2 = {w w does not contain the substring 1010} L3 = {w w starts with 1 and every even position of w is 0} Given these languages above, answer the following questions. (a) Using the construction in the proof of Theorem 1.45, give the state diagram of an NFA recognizing La = LUL. (b) Using the construction in the proof of Theorem 1.47, give the state diagram of an NFA recognizing Lo = L2 L3. (c) Using the construction in the proof of Theorem 1.49, give the state diagram of an NFA recognizing Le = (L3)*. (d) Using the construction given in the sample solution in the proof of Group Exercise 2 of HW 2, give the state diagram of an NFA recognizing Ld=(L) 5. 12pt (Submit a JFLAP file and a printout on your HW showing accepted/rejected strings) Consider the following languages. In all cases, 2 = {0,1}. L1 = {w w starts with a 1 and ends with a 0} L2 = {w w does not contain the substring 1010} L3 = {w w starts with 1 and every even position of w is 0} Given these languages above, answer the following questions. (a) Using the construction in the proof of Theorem 1.45, give the state diagram of an NFA recognizing La = LUL. (b) Using the construction in the proof of Theorem 1.47, give the state diagram of an NFA recognizing Lo = L2 L3. (c) Using the construction in the proof of Theorem 1.49, give the state diagram of an NFA recognizing Le = (L3)*. (d) Using the construction given in the sample solution in the proof of Group Exercise 2 of HW 2, give the state diagram of an NFA recognizing Ld=(L)