Express the following problems as languages, and then show thatthey are undecidable usingmap reduction and the known undecidableproblem A(tm).

(a) HelloWorldTM: determine whether a given TM halts on the input string “Hello” and loops on the input string “World” Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .