Compute the LR(1) parsing table for the following grammar

S -> Aa | bAc | Bc | bBa
A -> d
B -> d

Show that this grammar is not LALR(1).