Consider the following grammar G with {S, A, B} being the set of non-terminals, {a, b} being the set of terminals, and S being the start symbol. S A S B A aSa A a B bSb B b B a Is the grammar ambiguous? Justify your answer with reference to the rightmost derivations(s) of an arbitrary string (of length at least 6) in L(G)