Explanation : L1 = {0i1j| gcd (i, j) = 1}: There are infinite pair having gcd 1. We can't design FA for such language. That's why L1 is not regular. L2 is any subset of 0*, we can construct FA for any subset of single alphabet. That's why L2 is regular. So, option (B) is correct.