Let B $=\{$M $|$ M is a TM describing a language containing at least one string $w$ thathas $111$ as a substring $($i$.$e$.,w=x111y$ for some $x$ and $y).$ Do not use Rice theorem please.