Anyone Ca help me with question D ?

1. Consider the following grammar G. P-> L) L -L i a) Build the LR ( ) CFSM and thus show that G is an LR( ) gramma r . b) Build the LR( 0) parse table for G c) Build the SLR( 1) parse table for G d) Trace the parsing of the input (i ( using ) The LR( 0) parse table. ii) The SLR ( 1) parse table e) Discuss the difference between the two parses