Consider the following two grammars

G$1$: S $->$ SbS $|$ a

Pattern $$ababa$$

G$2$: S $->$ aB $|$ ab$,$ A $->$ AB $|$ a$,$ B $->$ ABb $|$ b

Pattern $$ab$$

Check for ambiguity in both the grammars, give all possible

parse tree generation for the patterns.