Here in L1 i, M is Accepting Finite String i.e atmost 2106 String so L1 is Regular.
But in L2 , M is accepting Atleast 2106 String that can go upto infinite and I can be founf by Turing machine and Turing machine accept Recursive Enumerable Language . So L2 is Recursive Enumerable.
Here L=L1 ∩ L2 = Regular ∩ RE => RE
Option 1 : Complement of RE may or may not be RE. So Option 1 Rejected
Option 2 : RE ∩ (may or may not be RE) => Nothing can be said
Option 3 : RE ∪ (May or May not be RE) => Nothing Can be said
Option D : Right
