both C and D are true , If LR is decidable then we can easily construct a turing machine which reverses the input and feeds it to turing machine for LR to get turing machine for L, so L is also decidable . Similarly if L is reducible to L1 = 0n 1n then as L1 is decidable so L is also decidable.