Question1: Consider the context-free grammars with the given strings and find the following: a) Give a leftmost derivation for the string. b) Give a rightmost derivation for the string. c) Give a parse tree for the string. d) Describe the language generated by this grammar. 1) S0S11S01001 with string 010101 2) S+SSISSIa with string * + aaa 3) SS+SISSI(S)ISIa with string a+(aa) 4) SaSbSbSaS with string bbabaa Question2: Design a grammar for the following language: The set of all strings of a's and b's that starts with ab. Ex: {abb,abba, abbba,,}