Which of the following regular expression generates the set of all strings not containing ‘baa’ as a substring over input alphabet {a, b}?
(a) a*(b*a)* (b) a*b*ab
(c) a*baba* (d) a*(ba+b)*
i think an answer would be both B & D but an answer is given D