Hi, Could anyone help me with the below assignment please.

Assignment 2: Implementation of Parser (Parse-Tree Generation):

Consider the following grammar, which is already suitable for LL (1) parsing:

1 Start Value $

2 Value num

3 | lparen Expr rparen

4 Expr plus Value Value

5 | prod Values

6 Values Value Values

7 |

Build an LL (1) parse table based on the grammar and explain your steps while you build