[5] (a) Compute the FIRST () and FOLLOW O sets for each of those non-terminals in G, given $ FOLLOWE). (b) Fill in the productions in state Is and add all those missing labeled transitions/edges in the following SLR automaton for G. You don't have to redraw the whole automaton Refer to edges in the automaton using the notation (IUI), assuming the edge to be directed from / to I 1 1. 1 EET T-F+T TF E-F.T T-F+T F- F Accept 18 1. T+F+T T-F+T TE 14 1 1. [8]