IN C Programming

Questionl (10 marks (3+3+4)) 1. Draw a DFA, M such that L(M) = {w {0,1}* | w contains 101 as substring} (1101, 101010 ok but 010011 not ok) 2. Write a C program that implements the DFA. 3. Draw a DFA that conforms to the following specifications: M = {Q, E,8,90, F} Q = {0, 1, 2, 3} = {a, b} 90=0 F= {3} The transition function 8 is represented by the following table: 8 . b 0 1 2 3 1 1 1 0 2 3 0 1 (a) Draw the DFA (b) Write a regular expression that represents the language accepted by the DFA