Consider the following computational problems ZTM = {(M) | M is a Turing machine and 0 L(M)} (a) (6 points) Design a computable mapping-reduction function F from Arm to ZTM. (Show that x e Atm iff F(x) ZTM) (b) (6 points) Design a computable mapping-reduction function G from Zrm to Arm. (Show that we ZTM iff G(x) Arm) (c) (2 points) Based on parts a and b, is Ztm decidable? (explain your answer.) (d) (2 points) Based on parts a and b, is Zrm recognizable? (explain your answer.) Consider the following computational problems ZTM = {(M) | M is a Turing machine and 0 L(M)} (a) (6 points) Design a computable mapping-reduction function F from Arm to ZTM. (Show that x e Atm iff F(x) ZTM) (b) (6 points) Design a computable mapping-reduction function G from Zrm to Arm. (Show that we ZTM iff G(x) Arm) (c) (2 points) Based on parts a and b, is Ztm decidable? (explain your answer.) (d) (2 points) Based on parts a and b, is Zrm recognizable? (explain your answer.)