Consider the given grammer $: $
$$
\begin{aligned}
& \mathrm{S} \rightarrow \mathrm{ACB} \\
& \mathrm{A} \rightarrow \mathrm{aA} \mid \epsilon \\
& \mathrm{C} \rightarrow \mathrm{cC} \mid \epsilon \\
& \mathrm{B} \rightarrow \mathrm{bB} \mid \mathrm{b}
\end{aligned}
$$
$\{\mathrm{S}, \mathrm{A}, \mathrm{B}, \mathrm{C}\}$ set of non-terminals where $\mathrm{S}$ is start symbol and $\{\mathrm{a}, \mathrm{b}, \mathrm{c}\}$ are the terminals. The number of $\mathrm{SR}$ conflicts in $\mathrm{LR(0)}$ is?
- $2$
- $3$
- $5$
- $4$
