2. [3+3] Define a Context Free Grammar for the following languages: (a) Binary strings of odd length which has 1 as middle symbol. (b) {abcd | i = 2l and j = k } Convert the following DFA state diagram into CFG. 3. [2] ab) ab) a,b