Answer all of the following question. Marks of the question indicate in the right margin. 1(a). Design a NFA to accept the language L=wiw has substring 101 in the hegging of string)- Find the transition table and function of the NFA. 16+3+6) 1(b). Draw a DFA from the constructed NFA of 1(a) by using subset construction method. 1(c). Construct a DFA that accept the strings of the language over the alphabet (0, 1) which have the number of consecutive I's in the string is divisible by 3 Construct transition function of the DFA