#TOC NPTEL ASSIGNMENT Question about reducibility

Question

Please help me understand this question. I have searched on internet, but not avail.

 

Click this to see the question

Answer 1

According to me, option A should be correct. 

Consider L1 is regular and the query being is L1 also context free?

now lets reduce L1 to any general language L2. 

1.  its clear that L1 complement is also regular and L2 complement will also be any generalized language. Hence L1 complement can be reduced to L2 complement.
2. L2 complement may or may not be reduced to L1 complement as general language can be regular or CFL or any other.
3. similarly L2 cannot be reduced to L1
4. with L1 not being kleen closure lets say L1 has any particular string so that makes L1 as decidable. Since L1 is reduced to L2 this means that L2 can or cannot be decidable. Hence option D is also false.