Consider the following figure and answer the questions given below:

1: How many reductions are required while parsing the string?

2: How does LR(0) parser parse the string? Show last ten (comma separated) entries in the stack (in left to right order)

3 Is this string also accepted by SLR(1) parser or not? Justify your answer in either case.

X WXY E Y2 Z Y w S2 1 S2 0 1 2 3 4 5 3 $ r2 accept r2 r4 r1 r3 r2 S5 4 String = ww