ACE TEST SERIES- THEORY OF COMPUTATION- DECIDABILITY

Question

Answer 1

Option A is correct as L is Decidable, its complement will also be decidable.

Comments

@NamitaKalra How u know that L is decidable?

Answer 2

option B is correct

1)   if L is an NP-class then L(M) is UNDECIDABLE 

 because the COMPLETENESS problem is always in TM , that means L is RECURSIVELY ENUMARABLE 

2)  As L is RECURSIVELY ENUMARABLE ,its doent allow MEMBERSHIP ALGORITHM so it is also

UNDECIDABLE 

but LANGUAGES ARE not closed under complementation in RE languages

i am sry i dont think the answer  was B i am wrong

i think mostly  4 or 3