Consider the following grammar: Terminals ={;, a } S-S; a la and LR(O) state machine. State 0 [S' +5] [S. Sja ) [S+.a] s State 2 [S' S.) [S+Sa] State 4 [S+S;a:] State 1 State 3 [S] [S+S;.a) and SLR(1) parse table: action goto State a iss state 0p1 po p11 p16 state 1p2 p7 p12p17 state 2p3 p8 p13p18 state 3p4 p9 p14p19 state 4p5p 10 p15p20 the p16 is