1. Prove that the following grammars are ambiguous (Note:in the following grammars, we have two terminal symbols, 'a' and 'b' and all non- terminal symbols are in upper-case letters, such as 'A. and S., S. is the start symbol and is the empty string): Grammar G s-sS s- ab s-ba Grammar G2 s ->AabaA A -> aA A -bA Grammar G3 s-ash s - bSa s- sS