Production Rules of the following CFG:

1. A CFG for alphabet (a.b) that recognizes the language consisting of all strings that start with an odd number of a's followed by the same number of b's. Test your program with the following input strings: ab, saba, aaabbb, saabbbbb, gazabbek 2. A CFG for alphabet (a.b) that recognizes the language consisting of all strings of length 1 or greater that do not contain the substring aa. Test your program with the following input strings: abba, abhabaaa, abaaban, hababbak, bbbabba 3. A CFG for alphabet (a.b) that recognizes the language consisting of all strings that contain exactly one b, have 2N a's (N>= 0, N is an integer) before the b, and 2N+1 a's after the b. Test your program with the following input strings: ber saabaaaa, rakaste akaa, saaabaaa