@utsab if you try to draw the SLR(1) you would get 6 states and the given grammar is LR(0) so must be SLR(1),LALR(1),CLR(1)/LR(1) now if you try to draw LR(1) table
you would get 7 states and there 2 states will differ by only look ahead symbols
1) s->(.s), &
s->.(s), )
s->.a, )
2) s->(.s), )
s->.(s), )
s->.a, ) // you can minimizes the number of states by merging them and minimized CLR(1) is known as LALR(1) so you will get same number of states as SLR(1)
Answers would be (B) n1=n3<n2