Recall that EQTM = { (M1, M2) | M1 and M2 are TMs and L(M)=L(M2) }. What is the function F corresponding to the mapping reduction implicit in the following proof? Let MEQ decide EQTM, then define TM METm to decide language Etm as follows: TM Merm = "On input (M), where M is a TM: Let Me be a TM that REJECTs all strings. Run MeQ((M,MX)). If MeQ accepts, then ACCEPT. If it rejects, then REJECT." F()= O a F() = Ob F() = . F() = Od