Q28

Consider the following grammar $G$, with $S$ as the start symbol. The grammar $G$ has three incomplete productions denoted by $(1), (2)$, and $(3)$.

$$\begin{aligned} & S \rightarrow d a T \mid \quad(1) \\ & T \rightarrow a S|b T| \quad(2) \\ & R \rightarrow(3) \mid \epsilon\end{aligned}$$

The set of terminals is $\{a, b, c, d, f\}$. The FIRST and FOLLOW sets of the different non-terminals are as follows. \begin{aligned} & \operatorname{FIRST}(S)=\{c, d, f\}, \operatorname{FIRST}(T)=\{a, b, \epsilon\}, \operatorname{FIRST}(R)=\{c, \epsilon\} \\ & \operatorname{FOLLOW}(S)=\operatorname{FOLLOW}(T)=\{c, f, \\}, \operatorname{FOLLOW}(R)=\{f\}\end{aligned}$ Which one of the following options CORRECTLY fills in the incomplete productions?