Consider alphabet $=\{0,1\}.$ Prove or disprove that for all languages $L_1,L_2,L$ over $,$ if $L_{1}subeLsube{L}_2$ and $L_1,L_2$ are Turing recognizable, then $L$ is Turing recognizable.

To disprove this statement, consider $L_1=\frac{O}{,}{L}_2={}^{**},L=A_d.$