Please post me answer for Problem 6 with reference to the above information

Recall the 'emptiness testing' language E_TM= { | M is a TM and L(M) = theta}. Define a mapping reduction from E_TM bar (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 bar is Turing recognizable and can assume there exists a recognizer R for E_TM bar in your construction (you don't have to describe how R works). With reference to the languages of the previous problem, does there exist a mapping reduction from E_TM to B? Briefly justify your answer. Recall the 'emptiness testing' language E_TM= { | M is a TM and L(M) = theta}. Define a mapping reduction from E_TM bar (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 bar is Turing recognizable and can assume there exists a recognizer R for E_TM bar in your construction (you don't have to describe how R works). With reference to the languages of the previous problem, does there exist a mapping reduction from E_TM to B? Briefly justify your