L2 is clearly regular as it can be written as : 0* (11)* in regular expression form..
Given L1 : 0n+m 1k+l | m = l and m,n,k,l >= 1
Now the key thing here is to satisfy m = l , we can adjust n and k accordingly , thereby the given language reduces to :
L1 : 0x 1y | x,y >= 2 which is regular.
Hence D) should be the correct answer.