Explain q3 in depth with producing a new unambiguous grammar

Problem 2 F is a grammar represented with the start symbol, S. The rules of this grammar are SSPPSPPUSUVV+PUabdV9c8 Assume only S, P, U and V are nonterminals. 1. Derive 8+c+a98bbcdd9b using left most derivation. If it is not possible, provide valid reason for your answer. 2. Draw the parse tree for the string you derived in (a) 3. Is the grammar ambiguous? If yes make it unambiguous else establish the precedences of "+" and