S -> (S)| aLet the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar n1 n2 and n3 respectively.

• A. n1 < n2 < n3
• B. n1 = n3 < n2
• C. n1 = n2 = n3
• D. n1 $ n3 $ n2