Question

#Design a DFA for each of the following Language over Alphabet {a,b}
i) L1={w | all strings start with b and ended with a)
ii. L2={w | all strings do not contain "bba') ​

Answer 1

Answer:

please brainliest me wkjs