Q.1 Max Score- 20 (part (a), (b) each 5) SEE FIG 1 aababa and bbaababaaa and determine if the strings are accepted aabaab and bbaababb and determine if the they are accepted Q2. Max score 20 strings of length 3n, n-0,i,2,... Q3. Max score 20 SEE FIG 3 Q. 4 Max score 20 (a) Find the sequences of configurations (computations) of the automaton on the strings (b) Find the sequences of configurations of the automaton on the strings (c) Describe (informally) the language accepted by the automaton Let 2-(a,b). Construct a finite automaton (in the form of a diagram) that accepts all the Transform the given NFA into DFA accepting the same language Convert the following regular expression to a FA accepting the corresponding language: Q. 5 Max score = 20, SEE FIG. 5 Convert thc given NFA into a regular expression 12 (l Fig. 1 Fig. 3 Fig 5