3. Consider the grammar with the following rules (capital letters are nonterminals and S is the start nonterminal): SUV a UXY VbUVE XdSd C YcXY E (a) (4 marks) Determine each of the sets i. FIRST(UV) ii. FIRST(XY) iii. FOLLOW (S) iv. FOLLOW (U) v. FOLLOW (V) vi. FOLLOW (X) vii. FOLLOW (Y) For each element z belonging to a set FOLLOW (W) (W {S,U,V,X,Y}) give a derivation starting from S where z occurs directly after W. If z is EOS, give a derivation starting from S where in the resulting string W occurs as the last symbol. (This is not required for the FIRST-sets.) (b) (2 marks) Does the grammar allow the use of recursive-descent parsing? Justify your answer using your answers from part (a) - please be specific and give a detailed answer.