Problem Regarding Recursive Language

[ravinder]

Nobody knows yet if P = NP. Consider the language L
defined as follows:
L = f (0 + 1) if P = NP
f  otherwise
Which of the following statements is true?

1) L is recursive
(2) L is recursively enumerable but not recursive
(3) L is not recursively enumerable
(4) Whether L is recursive or not will be known after we nd out if P = NP

[Brightguy]

You'll have to clarify your notation in the definition of L...