Concept Simplifiers

Consider the grammar S→(S)/a , Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n_1,n_2,and n_3respectively, Which of the following relationship holds?
n_1

Which of the following statement is wrong?
A. Any regular language can be generated by a context-free grammar
B. Some non-regular languages cannot be generated by any CFG
C. the intersection of a CFL and regular set is a CFL
D. All non-regular languages can be generated by CFGs.

Suppose the letter a, b, c, d, e has probabilities 1/2 ,1/4 ,1/8 ,1/16 ,1/32respectively, which of the following is the Huffman code for the letters a, b, c, d, e?
A. 0, 10, 110, 1110, 11110
B. 11, 10, 011, 010, 001
C. 11, 10, 01, 001, 0001
D. 110, 100, 010, 000, 001