Let G be any grammar with the following productions:
X → X + Y | Y
Y → Y * Z | Z
Z → (X)
Z → id
If LR(!) parser is used to parse the above grammar, then total how many look-a-heads are present for the item X → >Y and Z → .id in the initial state _____________.
Please explain your answer.