1. Using the LR(1) parser table created from the grammar G both shown below, show a parse of the sentence (id + id) * id. Show all work by showing the stack and show the remaining input string at each step. G: E + E +T|T T + T* F F F (E) id Action Goto * State id + $ $ ET F 0 S5 S4 1 1 2 3 1 1 S6 acc 2 R2 S7 R2 R2 3 R4 R4 R4 R4 4 S5 S4 8 8 2 3 5 R6 R6 R6 R6 6 S5 S4 9 3 7 S5 S4 10 8 S6 S11 9 R1 S7 R1 R1 10 3 ] 3 R3 R3 11 R5 R5 R5 R5