5. [25] The bottom-up parsing uses an LR-parser. Show a complete LR-parse, including parse stack ontents, input string, and action for the string a(a+a) that ends with a marker ' $ ', using the following rammar of the expression and the parse table below. Complete your parsing in the given empty table. lefer to the handout, LR-parsing-Action-GOTO.pdf. If you'd like to, you can write a program to nplement it in Q6. The output must print the LR-parsing table. Grammar: 1. EE+T, 2. ET 3. TTF 4. TF 5. F(E) 6. Fa Parse Table: LR-Parsing Table