GATE Computer Science (CS) 2013 Solved Paper

Consider the following two sets of LR(1) items of an LR(1) grammar.
X → c.X, c/d           X → c.X, $
X → .cX, c/d           X → .cX, $
X → .x, c/d             X → .d, $
Which of the following statements related to merging of the two sets in the corresponding LALR
parser is/are FALSE?
1. Cannot be merged since look aheads are different.
2. Can be merged but will result in S-R conflict.
3. Can be merged but will result in R-R conflict.
4. Cannot be merged since goto on c will lead to two different sets.