Consider the following grammar
S -> E
E -> T T'
E -> ( E )
T -> id
T -> id * E
T' -> + T
T' -> ?
(a) Is this grammar LL(1)? If not, show how to make it LL(1)
(b) Give an LL(1) parse table for the resulting grammar
(c) Show the moves of the parser on a valid and an invalid string.