Consider the following grammar:

$$\eqalign{ & S \to S \cr & S \to SS\,|\,a\,|\,\varepsilon \cr} $$

(a) Construct the collection of sets of LR(0) items for this grammar and draw its go to graph.

(b) Indicate the shift-reduce and reduce-reduce conflict (if any) in the various state of the LR(0) parser.