$($a$)$ Fill in the missing contents in the states of the SLR$(1)$ state machine for the given

grammar.

$($b$)$ Are there any states in the resulting state machine that contain a shift$-$reduce

conflict?

$($c$)$ If a conflict exists, can that conflict be eliminated by adding lookahead to the items

in the states as is done during construction of a LALR$(1)$ parser? Explain.

S A $|$ bAc $|$dc $|$bda

A d