I need to find the DFA that's the difference $($draw a DFA that accepts the language L$2$a$$L$2$b$.)$ between L$2$a and Consider the DFAs $DF{A}_{2a}$ and $DF{A}_{2b}$ in Fig. $1.$

Figure $1$: The DFAs named $DF{A}_{2a}$ and $DF{A}_{2b}.$

a $[7]$ Suppose that $L_{2a}$ is the language accepted by $DF{A}_{2a}$ and that $L_{2b}$ is the language accepted

by $DF{A}_{2b}.$ Using the DFA product construction, draw a DFA that accepts the language $L_{2a}-L_{2b}.$

Do not show any unreachable states.

b $[3]$ What is the relationship between $L_{2a}$ and $L_{2b}?($Are they equal? Is one a subset of the

other? Are they unrelated by subset inclusion?$)$ In addition to stating the relationship, explain

how you know the answer. Also, for each of the two languages, if there is at least one string in

one of the languages that is not in the other, give the shortest example of such a string.L$2$b