Consider the grammar S → aSaS |A It is ambiguous. What is the shortest string in L(S) that can be used to show the grammar is ambiguous? Write the string without any spaces. One way to show the...

" character to represent the right arrow. For example, S>aSb>ab might be a legal derivation for a string in another language. "/>
Extracted text: Consider the grammar S → aSaS |A It is ambiguous. What is the shortest string in L(S) that can be used to show the grammar is ambiguous? Write the string without any spaces. One way to show the grammar ambiguous is to give two derivations for your string with a particular property. Write the shorter of your derivations here (ie, fewest characters in the derivation): Give another derivation here: Your derivations should begin with S, end with your chosen shortest string from L(S) that shows ambiguity, and only make one substitution per step. Do not include any spaces in your answer. Use the ">" character to represent the right arrow. For example, S>aSb>ab might be a legal derivation for a string in another language.