GATE CS 2013 Q40 — Parsing (LL, LR)

Consider the following two sets of $\textsf{LR(1)}$ items of an $\textsf{LR(1)}$ grammar.$$\begin{array}{l|l} X \rightarrow c.X, c∕d &X → c.X, \$\\ X \rightarrow .cX, c∕ d& X → .cX, \$\\ X \rightarrow .d, c∕ d & X → .d, \$ \end{array}$$Which of the following statements related to merging of the two sets in the corresponding $\textsf{LALR}$ parser is/are FALSE?

1. Cannot be merged since look aheads are different.
2. Can be merged but will result in $\textsf{S-R}$ conflict.
3. Can be merged but will result in $\textsf{R-R}$ conflict.
4. Cannot be merged since $\textsf{goto}$ on $c$ will lead to two different sets.