Part II: Proofs (40 pt.) 3. (10 pt.) Let G be the context-free grammar with the following rules: SSS TSTTab Assume that S is the start symbol. Prove that this grammar is ambiguous by giving two different leftmost derivations and the corresponding parse trees for some string..