Okay, we have L1 and L2 are complement of each other here.and we know that recursives are closed under complementation! so if L1 is recursive then L2 has to be recursive and vice versa.
so we can easily get rid of option A, B here
Now, i assume that L(M) means Language of turing Machine
Now let's
check for L1:
After providing an Input,if the it goes >= 3 then it Accepts it but if it gets into Loop, much before ,then we have no way to know if it will Accept that i/p or Not
so we can't say it rejects for other inputs
so it is Recursively Enumerable but not Recursive
Check for L2:
No way to know,what's going to happen if it gets into a loop
so it is Non RE
ALTERNATIVE:
Both of this are Non-Trivial Property.According to Rice theorem they are Not Recursive
So D should be the answer.Correct me ,if i am wrong