L is polynomial time verifiable and exponantial time solvable. So it must be NP but not P.Ifthere exist a problem which is in NP but not in P i.e. P!=NP.
what is option (3). NP ---> P i.e. all NP can be converted into P in polynomial amount of time whichmeans NP = P but it is already false.
Obviously L should not be NPC.