[1]+[5]+[(2)+(6)+(6)] a) Consider the language: L={ww=anbm,n1,m2} Determine whether or not the language is regular. If it is, write a: 1. Finite state automaton accepting it. 2. Regular grammar generating it. If it is not (regular) explain in details why it is not so. [4+4] b) Consider the following context free language (CFL) {ambncnm>0 and even, n>0 and odd } Write the corresponding context free grammar (CFG) generating it. [12] [1]+[5]+[(2)+(6)+(6)] a) Consider the language: L={ww=anbm,n1,m2} Determine whether or not the language is regular. If it is, write a: 1. Finite state automaton accepting it. 2. Regular grammar generating it. If it is not (regular) explain in details why it is not so. [4+4] b) Consider the following context free language (CFL) {ambncnm>0 and even, n>0 and odd } Write the corresponding context free grammar (CFG) generating it. [12]