Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is
This link might be helpful
Answer should be D. Right?
Because no of states in SLR and LALR are less than or equal to LR(1)
Refund time depends on the payment mode --...