any problem and not clear picture. please help me as soon as possible.

Problem 2. (32 points) Consider the following context-free grammar. 1. S:x=XX 2. S:i=Y y Y 3. X is d. Y itime a. (2 points) What is the language L described by the grammar? b. (6. points) Compute the first sets for S,X, and Y. You must ahow the iterations of the algorithm separately. c. (6 points) Compute the follow sets for S,X, and Y. You must show the iterations of the algorithm separately. d. (6points) Conatruot the LL(1) parsing table for the grammar. It is enough to fust show the table. e.) (12 points) Show the steps in parsing the skrings from Li