Q. 3 Maximum score 10 Construct a DFA which will accept the language: {we (a, b)* |every a in w is immediately preceded and followed by b}