C. (12pt) Convert the language L generated by the following regular expressions to a nondeterministic finite automaton. (You may refer to Lemma 1.55 in the textbook). L = (01+11)*(0+1+E) i. (3pt) Use JFLAP to draw the NFA for L. Include the test for the first 5 accepted strings in the screen shot. Include the test for the first 5 rejected strings in the screen shot. (3pt) Use JFLAP to draw the NFA for L* (the start closure). Include the test for the first 5 accepted strings in the screen shot. Include the test for the first 5 rejected strings in the screen shot. ii. (3pt) Briefly describe the language L accepted by the regular expression. A neat definition for L could be very helpful for you to design the DFA in the next question. 0 Hints: describe the strings of L in terms of their odd or even positions, where the first position of a string is defined to be position 1, which is an odd position. The even positions begin at position 2. iv. (3pt) Based on your definition of the language L, use JFLAP to draw a 3-state DFA transition diagram that accepts L Include the test for the first 5 accepted strings in the screen shot. Include the test for the first 5 rejected strings in the screen shot. Your machine has to be a 3-state DFA to receive the full credit