Q.3) (16 pts] Give a minimal regular expression for each of the following languages. a) The language generated by the grammar: S ABS E A adla BB & b) L={w E {0,1 } / w neither contains consecutive O's nor consecutive l's). c) L = {a"b" | n+m+r is odd}. d) The language accepted by the following DFA: a.b a a a.b b a