In this question, L₁, L₂, L₃, L₄ refer to languages and M, M₁, M₂ refer to Turing machines. Let

L₁ = {(M₁,M₂) | L(M₁) is a subset of L(M₂)},

L₂ = {M | There exists an input on which TM M halts within 100 steps},

L₃ = {M | There exists an input w of size less than 100, such that M accepts w},

L₄ = {M | L(M) contains at least 2 strings}.

Decide whether each of L₁, L₂, L₃ and L₄ are recursive, RE or neither. Then identify the true statement below.

a) L₃ is recursive.

b) L₃ is recursively enumerable.

c) L₄ is recursive.

d) The complement of L₃ is recursively enumerable.

Solution plz explain?