Assume that LR(0) parser has n1 states, SLR(1) has n2 states, CLR(1) has n3 states and LALR(1) has n4 states for grammar G. Which of the following relationship is not true among all the states is:
1
n3 ≥ n1 = n2 = n4
2
n1 ≥ n2 = n3 ≥ n4
3
n1 < n2 = n3 ≥ n4
4
n1 > n2 > n3 > n4