The following dfa M does notrecognize the language L3of any string over the alphabet {a,b,c} with at leasttwo bs or at least three cs.

Produce six input strings that are either in L3 but are not accepted by M, or that are accepted by M and are not in L3.

b a 91 b b 93 90 b a 92 QU b a 94