3. Consider the grammar with the following rules (capital letters are nonterminals and S is the start nonterminal): a S + UV U + XY V+bUVE X +dSdc Y+cXY (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) (WE {S, U, V, X,Y}) give a derivation starting from S where 2 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