Answer is C. As LALR(1) parsing table is constructed from combining LR(1) states with similar LR(0) items and different lookaheads. Hence it has lesser states and hence less space for parsing table.
SLR(1) and LALR(1) parsers have same number of states.
