This is a question and answer, Could you tell me is this a correct answer or not. Do not Copy any answers from other website!

4. (15 points) Please design an NFA with no more than 6 states to recognize the following language (10 points), and please briefly explain how your NFA works (5 points). L = {x over {0, 1} | x contains substring 010 or substring 101 } 4 Question 4 For containing 010 and 101 are shown as Figure 4 and Figure 5, Combine them together ,so that (graph is shown in the Figure 6) 83 Figure 5: minimum NFA S0 Figure 4: minimum NFA S1 S3 80 S4 Figure 6: minimum NFA S1 1,0 1,0 0 S3 So S4 Figure 7: minimum NFA