NAME 1) Wrae the CEG for language: L (d'bed" with :>) and with even and with k odd; km > 0) over alphabet (a,b,c,d) (for example subbedd belongs to L). Also briefly explain in your own words the reasoning behind the solution you have provided. 2) Conxder language L - w/w has even length and the second half of w does not contain Os) over alphabet (6.1). Ilanguage Lis regular, draw the DFA that recognises it. If it is not regular, prove it using the Pumping Lama 3) Consider language L = (dbe with m> or ack;mak>0} over alphabet {a,b,c). If language L is opular, draw the DFA that recognises it. If it is not regular, prove it using the Pumping Lemma 4) Draw the PDA recognizing language L = {{"b*c* with m #n; m,nk>=0) over alphabet (a,b,c). Add a briel explanation, in your own words, of the meaning of each state that you have created. 3) Wnte the RE for language L - (w/whas even length and has at least one I) over alphabet (0,1). Wnite the CEG for language L-{w/w has odd length and has an odd number of as and its middle symbol is a b) over alphabet (4.664(for example: string deabcbd belongs to L) 7) Draw the DFA recognizing language L = {w/whas an even number of occurrences of substring II, and w has an am mumber of Os) over alphabet (0,1). (note that substrings can overlap, so string 011101100 has three occurrences of substring !!). Add a brief explanation, in your own words, of the meaning of each state that you have created