3. (2 points) Three parts: a) Given the following LR(O) grammar, create the state diagram and action-goto tables. b) Demonstrate the stack, input and actions for the parse of the given string. c) Show the parse tree that corresponds to that parse. grammar s- (L) L-, L , S input string: (x,x)S