(8 points) (Due: 11:59pm, Thursday, February 6) This is an individual assignment. 1. For each of the following regular expressions, give three strings that can be generated by the regular expression and one string that use the same alphabet but cannot be generated (0.8 point cach, 2.4 points total) 1) a. ( 0 1 ) - 0 (0 b. (ab 1 ) 10..91 - c. (a (be) *) d - a, b): 2. Write regular expressions for the following languages over the alphabet (0.6 point cach, 1.8 points total) a. All strings that end with ab. b. All strings that do not contain the substring of ab. c. All strings that contain an even number (e.g,0, 2, 4, ...) of a's. 3. Consider the following regular expression: (abac) Use Thompson's construction to construct an NFA convert the NFA LO DFA and minimize the DFA. Show the solution step by step. (3.8 points) Deliverables (1) Prepare your answers in a document in pdf format. (2) Submit the document to myCourses. (3) A discussion forum is opened (FAQ for Assignment) for assignment 1 and will be closed at 2pm on Thursday, February 6th. If you have questions regarding the assignment, you can post the questions there