Recall the emptiness testing' language E_TM = { | M is a TM and L(M) = phi}. Define a mapping reduction from E_TM (the complement of E_TM) to the language B = {|Q is a TM such that 011 elementof L(Q)}. You can use the fact that E_TM is Turing recognizable and can assume there exists a recognizer R for E_TM in your construction (you don't have to describe how R works)