Answer is A
Statement 1 is true: Using GNF we can convert Left recursive grammar to right recursive and by using reversal of CFG and GNF we can convert right recursive to left recursive.
Statement 3 is true because right linear grammar generates regular set
Statement 4 is true, only two non-terminals are there in each production in CNF. So it always form a binary tree.
Statement 2 is true, we can remove null productions from any context free grammar G producing language L(G) using suitable transformations such that the new grammar G1 will produce language L1(G1).
The new language L1 will produce every string produced by L except for Null string.
But the statement given in question does not mention the new grammar to be equivalent of the original grammar. Therefore statement 2 is also TRUE and the answer is A