#1. Consider the following algorithm to compute FIRST set Algorithm to compute FIRST given a grammar G. Let X be or be in VorT First(X) is the set of the first terminal in any sentential form derived from X. If X is a terminal or , then First(X )- ). ItX is a nonterminal and X X1 X2 Xn is a rule, then First(X1)-{} is a subset of First(X) First(, )-{ is a subset of First(X) if for alljci is in First(X) if for all jSn First(X)contains First(x) contains { Note, is a null-string. V is a set of non-terminal symbols and T is a set of terminal symbols of a grammar G. Apply the algorithm to the following grammar Gas shown below. Show your work/steps. exp-term exp' exp-addop term exp' exp' addop + 5 addop . 6 term-factor term, 7 term, mulop factor term 8 term, 9 mulop * 10 mulop/ 11 factor ( exp ) 12 factor n 13 factor-id Place your answer here - list of FIRST set for each symbol of G FIRST(X)