QUESTION 3 Given the following grammar G with S as the start symbol S->AB A-> A B -> BB which of the following strings is not in the language of G? ) A. b B.bb C.ab D. a QUESTION 4 Given the grammar below, which of the following is a left most derivation of 10 S -> S(S) S -> A S=> S[S] => S[] => S[S] () => S [ => 0 S=> S[S] => S[S][S] => [S] [S] => [S] => [0] S=> S[S] => S [S]S] => [S][S] => [S] [] => 0 S=> S[S] => S[S] [S] => [S] [] => [S] () => [0