Consider the following grammar with start symbol S:

S -> SS

S -> (S)

S ->

Show that this grammar is ambiguous by generating two different parse trees for the sentence ()(). Give an equivalent unambiguous grammar.