1. Construct grammar for the below 'English' statement. Given an alphabet ={a,b}, generate a grammar that represents strings that start with a when it ends with b and start with b when it ends with a. 2. Construct grammar for the below 'English' statement. Given an alphabet ={a,b}, generate a grammar that represents strings with an equal number of a's and b 's 3. Is the following BNF grammar ambiguous? If so, design an unambiguous grammar that produces the same binary-string language. binary string >01