Consider a context-free grammar G=({0,1},{S,A,B},S,P), where P is the set of productions: SOA1BA1S0AAB0S1BB a) Give a leftmost derivation of the string 0011. b) Give a rightmost derivation of the string 0011 . c) Draw a parse tree for the string 1001. d) Can the string 1110 be derived from the grammar G? If yes, write down the associated derivation tree. If not, give a justification