1.Every left recursive grammar can be converted to a right recursive grammar and vice versa
yes their is algo.
2. All ∈ production can be removed from any CFG by suitable transformation
NO when language itself contain null then u can't remove null.
3. The language generated by a CFG all whose production are to the form X→ w or X→ wY
yup their is formula for it X-> aT* then regular since right linear form
4.The derivation trees of strings generated by a CFG in CNF are alays binary trees.
yes b/c cfn in form of S->AB or S->a so max two child at a time.
Answer is (C)