Q. IMaximum score 10 Give a clear English description of the language accepted by the following DFA: 2 5 Q.2 Maximum score 10 Construct a DFA (a diagram) that accepts all strings in the alphabet fa,b} of length up to 3. Q.3 Maximum score 10 and followed by b Q. 4 Maximum score 10 Construct a DFA which will accept the language: (w e fa, b)* levery a in w is immediately preceded Construct a DFA which will accept the language: {w e {a, b} w has bbab as a substring). Q.5 Maximum score 10 Construct a DFA which will accept the language: fw e fa, bi*| w has both aa and bb as a substrings)